./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:37:17,892 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:37:17,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:37:17,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:37:17,916 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:37:17,919 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:37:17,920 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:37:17,922 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:37:17,923 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:37:17,924 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:37:17,924 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:37:17,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:37:17,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:37:17,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:37:17,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:37:17,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:37:17,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:37:17,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:37:17,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:37:17,943 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:37:17,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:37:17,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:37:17,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:37:17,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:37:17,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:37:17,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:37:17,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:37:17,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:37:17,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:37:17,953 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:37:17,953 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:37:17,953 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:37:17,954 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:37:17,955 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:37:17,955 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:37:17,956 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:37:17,957 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:37:17,957 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:37:17,957 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:37:17,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:37:17,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:37:17,958 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 21:37:17,974 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:37:17,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:37:17,974 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:37:17,975 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:37:17,975 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:37:17,975 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:37:17,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:37:17,976 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:37:17,976 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:37:17,976 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:37:17,976 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:37:17,976 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:37:17,976 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:37:17,977 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:37:17,977 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:37:17,977 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:37:17,977 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:37:17,977 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:37:17,977 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:37:17,977 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:37:17,978 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:37:17,978 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:37:17,978 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:37:17,978 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:37:17,978 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:37:17,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:37:17,979 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:37:17,979 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:37:17,979 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 21:37:17,979 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 21:37:17,980 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:37:17,980 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2021-12-18 21:37:18,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:37:18,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:37:18,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:37:18,159 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:37:18,159 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:37:18,160 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-18 21:37:18,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587e9fef0/dbbf841f91b14b0d88aa9cd51fc90e89/FLAG83fd4c873 [2021-12-18 21:37:18,535 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:37:18,538 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-18 21:37:18,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587e9fef0/dbbf841f91b14b0d88aa9cd51fc90e89/FLAG83fd4c873 [2021-12-18 21:37:18,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/587e9fef0/dbbf841f91b14b0d88aa9cd51fc90e89 [2021-12-18 21:37:18,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:37:18,933 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:37:18,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:37:18,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:37:18,939 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:37:18,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:37:18" (1/1) ... [2021-12-18 21:37:18,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95a7318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:18, skipping insertion in model container [2021-12-18 21:37:18,942 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:37:18" (1/1) ... [2021-12-18 21:37:18,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:37:18,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:37:19,183 WARN L230 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/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-18 21:37:19,185 WARN L230 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/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-18 21:37:19,186 WARN L230 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/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-18 21:37:19,186 WARN L230 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/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-18 21:37:19,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:37:19,196 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:37:19,228 WARN L230 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/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-18 21:37:19,229 WARN L230 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/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-18 21:37:19,230 WARN L230 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/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-18 21:37:19,230 WARN L230 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/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-18 21:37:19,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:37:19,257 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:37:19,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19 WrapperNode [2021-12-18 21:37:19,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:37:19,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:37:19,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:37:19,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:37:19,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,272 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,288 INFO L137 Inliner]: procedures = 119, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2021-12-18 21:37:19,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:37:19,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:37:19,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:37:19,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:37:19,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:37:19,311 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:37:19,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:37:19,312 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:37:19,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (1/1) ... [2021-12-18 21:37:19,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:37:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:19,335 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) [2021-12-18 21:37:19,344 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 [2021-12-18 21:37:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-18 21:37:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-18 21:37:19,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:37:19,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:37:19,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:37:19,363 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:37:19,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:37:19,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-18 21:37:19,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:37:19,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:37:19,424 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:37:19,425 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:37:19,668 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:37:19,672 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:37:19,673 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-18 21:37:19,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:37:19 BoogieIcfgContainer [2021-12-18 21:37:19,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:37:19,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:37:19,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:37:19,690 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:37:19,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:37:18" (1/3) ... [2021-12-18 21:37:19,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7c0896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:37:19, skipping insertion in model container [2021-12-18 21:37:19,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:37:19" (2/3) ... [2021-12-18 21:37:19,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7c0896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:37:19, skipping insertion in model container [2021-12-18 21:37:19,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:37:19" (3/3) ... [2021-12-18 21:37:19,693 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2021-12-18 21:37:19,698 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:37:19,699 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-12-18 21:37:19,737 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:37:19,744 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 21:37:19,744 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-12-18 21:37:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:37:19,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:19,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:37:19,764 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:19,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:19,767 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 21:37:19,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:19,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565951830] [2021-12-18 21:37:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:19,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:19,909 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:19,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565951830] [2021-12-18 21:37:19,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565951830] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:19,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:19,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:37:19,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649261194] [2021-12-18 21:37:19,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:19,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:37:19,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:19,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:37:19,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:37:19,943 INFO L87 Difference]: Start difference. First operand has 121 states, 66 states have (on average 2.1363636363636362) internal successors, (141), 120 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:20,061 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2021-12-18 21:37:20,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:37:20,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 21:37:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:20,069 INFO L225 Difference]: With dead ends: 123 [2021-12-18 21:37:20,070 INFO L226 Difference]: Without dead ends: 119 [2021-12-18 21:37:20,071 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:37:20,074 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:20,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 75 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:20,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-12-18 21:37:20,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2021-12-18 21:37:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 67 states have (on average 1.8208955223880596) internal successors, (122), 114 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 122 transitions. [2021-12-18 21:37:20,102 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 122 transitions. Word has length 3 [2021-12-18 21:37:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:20,102 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 122 transitions. [2021-12-18 21:37:20,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2021-12-18 21:37:20,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:37:20,103 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:20,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:37:20,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-18 21:37:20,103 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:20,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:20,104 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 21:37:20,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:20,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018517233] [2021-12-18 21:37:20,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:20,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:20,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:20,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:20,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018517233] [2021-12-18 21:37:20,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018517233] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:20,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:20,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:37:20,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828775104] [2021-12-18 21:37:20,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:20,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:37:20,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:20,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:37:20,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:37:20,135 INFO L87 Difference]: Start difference. First operand 115 states and 122 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:20,239 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2021-12-18 21:37:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:37:20,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 21:37:20,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:20,242 INFO L225 Difference]: With dead ends: 133 [2021-12-18 21:37:20,242 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 21:37:20,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:37:20,243 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 98 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:20,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 80 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 21:37:20,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2021-12-18 21:37:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2021-12-18 21:37:20,255 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 3 [2021-12-18 21:37:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:20,255 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2021-12-18 21:37:20,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,255 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2021-12-18 21:37:20,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 21:37:20,255 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:20,256 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:20,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-18 21:37:20,256 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:20,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:20,256 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2021-12-18 21:37:20,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:20,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501122243] [2021-12-18 21:37:20,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:20,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:20,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:20,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501122243] [2021-12-18 21:37:20,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501122243] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:20,312 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:20,312 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:37:20,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327756936] [2021-12-18 21:37:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:20,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:37:20,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:37:20,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:37:20,313 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:20,449 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2021-12-18 21:37:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:37:20,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-18 21:37:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:20,454 INFO L225 Difference]: With dead ends: 125 [2021-12-18 21:37:20,454 INFO L226 Difference]: Without dead ends: 125 [2021-12-18 21:37:20,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:37:20,458 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 158 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:20,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 63 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:20,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-12-18 21:37:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2021-12-18 21:37:20,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 110 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2021-12-18 21:37:20,473 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 8 [2021-12-18 21:37:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:20,473 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2021-12-18 21:37:20,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2021-12-18 21:37:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-18 21:37:20,474 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:20,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:20,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-18 21:37:20,475 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:20,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2021-12-18 21:37:20,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:20,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929008338] [2021-12-18 21:37:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:20,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:20,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:20,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:20,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929008338] [2021-12-18 21:37:20,599 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929008338] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:20,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:20,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:37:20,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815302252] [2021-12-18 21:37:20,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:20,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:37:20,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:20,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:37:20,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:20,602 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:20,778 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2021-12-18 21:37:20,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:37:20,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-18 21:37:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:20,779 INFO L225 Difference]: With dead ends: 145 [2021-12-18 21:37:20,779 INFO L226 Difference]: Without dead ends: 145 [2021-12-18 21:37:20,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:37:20,781 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 249 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:20,781 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 102 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:37:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-12-18 21:37:20,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2021-12-18 21:37:20,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 84 states have (on average 1.5238095238095237) internal successors, (128), 117 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 128 transitions. [2021-12-18 21:37:20,785 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 128 transitions. Word has length 8 [2021-12-18 21:37:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:20,786 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 128 transitions. [2021-12-18 21:37:20,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,786 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 128 transitions. [2021-12-18 21:37:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 21:37:20,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:20,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:20,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-18 21:37:20,787 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1117785369, now seen corresponding path program 1 times [2021-12-18 21:37:20,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:20,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602234628] [2021-12-18 21:37:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:20,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:20,830 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:20,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602234628] [2021-12-18 21:37:20,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602234628] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:20,831 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:20,831 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:37:20,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962830492] [2021-12-18 21:37:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:20,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:37:20,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:20,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:37:20,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:37:20,833 INFO L87 Difference]: Start difference. First operand 118 states and 128 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:20,916 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2021-12-18 21:37:20,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:37:20,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 21:37:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:20,917 INFO L225 Difference]: With dead ends: 130 [2021-12-18 21:37:20,917 INFO L226 Difference]: Without dead ends: 130 [2021-12-18 21:37:20,917 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:37:20,918 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:20,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 133 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:20,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-18 21:37:20,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 116. [2021-12-18 21:37:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-18 21:37:20,921 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 10 [2021-12-18 21:37:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:20,921 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-18 21:37:20,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-18 21:37:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:37:20,922 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:20,922 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:20,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-18 21:37:20,922 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:20,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2021-12-18 21:37:20,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:20,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389297048] [2021-12-18 21:37:20,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:20,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:20,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:20,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:20,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389297048] [2021-12-18 21:37:20,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389297048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:20,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:20,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:37:20,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527096476] [2021-12-18 21:37:20,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:20,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:37:20,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:20,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:37:20,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:20,987 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:21,107 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2021-12-18 21:37:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:37:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 21:37:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:21,108 INFO L225 Difference]: With dead ends: 116 [2021-12-18 21:37:21,108 INFO L226 Difference]: Without dead ends: 116 [2021-12-18 21:37:21,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:37:21,109 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:21,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 249 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-12-18 21:37:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2021-12-18 21:37:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 114 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2021-12-18 21:37:21,112 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 12 [2021-12-18 21:37:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:21,112 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2021-12-18 21:37:21,113 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2021-12-18 21:37:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:37:21,113 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:21,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:21,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-18 21:37:21,113 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:21,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:21,114 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2021-12-18 21:37:21,114 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:21,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295507358] [2021-12-18 21:37:21,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:21,115 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:21,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:21,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295507358] [2021-12-18 21:37:21,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295507358] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:21,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:21,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:37:21,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145016020] [2021-12-18 21:37:21,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:21,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:37:21,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:21,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:37:21,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:21,168 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:21,359 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-12-18 21:37:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:37:21,362 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 21:37:21,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:21,363 INFO L225 Difference]: With dead ends: 117 [2021-12-18 21:37:21,363 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 21:37:21,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:37:21,364 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 18 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:21,364 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 284 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 21:37:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2021-12-18 21:37:21,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 109 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2021-12-18 21:37:21,367 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 12 [2021-12-18 21:37:21,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:21,367 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2021-12-18 21:37:21,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,368 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2021-12-18 21:37:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 21:37:21,368 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:21,368 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:21,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-18 21:37:21,368 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:21,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:21,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1066467192, now seen corresponding path program 1 times [2021-12-18 21:37:21,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:21,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410663433] [2021-12-18 21:37:21,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:21,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:21,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:21,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410663433] [2021-12-18 21:37:21,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410663433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:21,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:21,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 21:37:21,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483996485] [2021-12-18 21:37:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:21,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:37:21,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:21,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:37:21,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:21,409 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:21,535 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2021-12-18 21:37:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:37:21,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 21:37:21,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:21,537 INFO L225 Difference]: With dead ends: 167 [2021-12-18 21:37:21,537 INFO L226 Difference]: Without dead ends: 167 [2021-12-18 21:37:21,537 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:37:21,538 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 205 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:21,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 227 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:21,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2021-12-18 21:37:21,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 117. [2021-12-18 21:37:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4) internal successors, (126), 116 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2021-12-18 21:37:21,541 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 13 [2021-12-18 21:37:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:21,541 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2021-12-18 21:37:21,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,542 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2021-12-18 21:37:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:37:21,542 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:21,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:21,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-18 21:37:21,542 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:21,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1434903386, now seen corresponding path program 1 times [2021-12-18 21:37:21,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:21,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658569431] [2021-12-18 21:37:21,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:21,543 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:21,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:21,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658569431] [2021-12-18 21:37:21,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658569431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:21,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:21,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:37:21,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888514926] [2021-12-18 21:37:21,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:21,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:37:21,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:21,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:37:21,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:37:21,620 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:21,689 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2021-12-18 21:37:21,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:37:21,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 21:37:21,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:21,690 INFO L225 Difference]: With dead ends: 121 [2021-12-18 21:37:21,690 INFO L226 Difference]: Without dead ends: 121 [2021-12-18 21:37:21,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:21,691 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:21,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 272 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-12-18 21:37:21,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2021-12-18 21:37:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2021-12-18 21:37:21,693 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 20 [2021-12-18 21:37:21,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:21,693 INFO L470 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2021-12-18 21:37:21,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2021-12-18 21:37:21,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:37:21,694 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:21,694 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:21,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-18 21:37:21,694 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:21,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:21,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1476921639, now seen corresponding path program 1 times [2021-12-18 21:37:21,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:21,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935464496] [2021-12-18 21:37:21,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:21,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:21,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:21,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935464496] [2021-12-18 21:37:21,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935464496] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:21,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022506620] [2021-12-18 21:37:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:21,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:21,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:21,744 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) [2021-12-18 21:37:21,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-18 21:37:21,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:21,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 21:37:21,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:21,905 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:21,918 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:21,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:21,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:37:21,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:21,959 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:37:22,056 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:22,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:22,065 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:22,067 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:22,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 10 [2021-12-18 21:37:22,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:22,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:22,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 19 [2021-12-18 21:37:22,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 17 [2021-12-18 21:37:22,367 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 21 [2021-12-18 21:37:22,371 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2021-12-18 21:37:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:22,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022506620] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:22,387 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:22,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2021-12-18 21:37:22,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774478847] [2021-12-18 21:37:22,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:22,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-18 21:37:22,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:22,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-18 21:37:22,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:37:22,389 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:22,631 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2021-12-18 21:37:22,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-18 21:37:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 21:37:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:22,632 INFO L225 Difference]: With dead ends: 143 [2021-12-18 21:37:22,632 INFO L226 Difference]: Without dead ends: 143 [2021-12-18 21:37:22,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-18 21:37:22,633 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 162 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:22,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 453 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 378 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2021-12-18 21:37:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-12-18 21:37:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2021-12-18 21:37:22,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 122 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2021-12-18 21:37:22,635 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 20 [2021-12-18 21:37:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:22,635 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2021-12-18 21:37:22,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2021-12-18 21:37:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:37:22,636 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:22,636 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:22,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-18 21:37:22,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-12-18 21:37:22,852 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:22,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:22,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451530, now seen corresponding path program 1 times [2021-12-18 21:37:22,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:22,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732748692] [2021-12-18 21:37:22,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:22,852 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:22,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:22,905 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:22,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732748692] [2021-12-18 21:37:22,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732748692] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:22,905 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:22,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:37:22,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678484165] [2021-12-18 21:37:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:22,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:37:22,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:37:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:22,906 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:23,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:23,031 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-12-18 21:37:23,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:37:23,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-18 21:37:23,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:23,032 INFO L225 Difference]: With dead ends: 123 [2021-12-18 21:37:23,032 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 21:37:23,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:37:23,033 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:23,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 246 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 21:37:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2021-12-18 21:37:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.3541666666666667) internal successors, (130), 121 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2021-12-18 21:37:23,035 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 21 [2021-12-18 21:37:23,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:23,035 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2021-12-18 21:37:23,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:23,035 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2021-12-18 21:37:23,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-18 21:37:23,036 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:23,036 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:23,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-18 21:37:23,036 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1060451529, now seen corresponding path program 1 times [2021-12-18 21:37:23,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:23,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977392150] [2021-12-18 21:37:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:23,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:23,112 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:23,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977392150] [2021-12-18 21:37:23,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977392150] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:23,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:23,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:37:23,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429748439] [2021-12-18 21:37:23,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:23,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:37:23,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:23,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:37:23,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:23,114 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:23,228 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2021-12-18 21:37:23,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:37:23,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-12-18 21:37:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:23,229 INFO L225 Difference]: With dead ends: 120 [2021-12-18 21:37:23,229 INFO L226 Difference]: Without dead ends: 120 [2021-12-18 21:37:23,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:37:23,230 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 9 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:23,230 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 292 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:37:23,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-18 21:37:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2021-12-18 21:37:23,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-18 21:37:23,232 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 21 [2021-12-18 21:37:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:23,232 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-18 21:37:23,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:23,232 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-18 21:37:23,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-18 21:37:23,232 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:23,232 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:23,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-18 21:37:23,232 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:23,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:23,233 INFO L85 PathProgramCache]: Analyzing trace with hash -794042809, now seen corresponding path program 1 times [2021-12-18 21:37:23,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:23,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061270714] [2021-12-18 21:37:23,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:23,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:23,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:23,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061270714] [2021-12-18 21:37:23,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061270714] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:23,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303586745] [2021-12-18 21:37:23,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:23,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:23,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:23,398 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) [2021-12-18 21:37:23,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-18 21:37:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:23,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 21:37:23,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:23,484 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:23,499 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:37:23,558 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:23,559 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:23,595 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:23,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:23,602 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2021-12-18 21:37:23,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2021-12-18 21:37:23,662 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:23,681 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:23,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:23,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:23,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:23,744 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:23,757 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:23,762 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:23,769 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_316 Int)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_316)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:23,824 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_7| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_57| Int) (v_ArrVal_316 Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_57| v_ArrVal_316)) |v_ULTIMATE.start_main_#t~malloc3#1.base_7| v_ArrVal_319) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_57|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_7|))))) is different from false [2021-12-18 21:37:23,835 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:23,838 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:23,838 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2021-12-18 21:37:23,841 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2021-12-18 21:37:23,843 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 21:37:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:23,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303586745] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:23,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:23,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 25 [2021-12-18 21:37:23,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514214360] [2021-12-18 21:37:23,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:23,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 21:37:23,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 21:37:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=302, Unknown=5, NotChecked=200, Total=600 [2021-12-18 21:37:23,857 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:24,272 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2021-12-18 21:37:24,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-18 21:37:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-12-18 21:37:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:24,274 INFO L225 Difference]: With dead ends: 255 [2021-12-18 21:37:24,274 INFO L226 Difference]: Without dead ends: 255 [2021-12-18 21:37:24,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=205, Invalid=622, Unknown=5, NotChecked=290, Total=1122 [2021-12-18 21:37:24,275 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 336 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 682 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:24,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 536 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 591 Invalid, 0 Unknown, 682 Unchecked, 0.2s Time] [2021-12-18 21:37:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2021-12-18 21:37:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 128. [2021-12-18 21:37:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 127 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-12-18 21:37:24,278 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 23 [2021-12-18 21:37:24,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:24,278 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-12-18 21:37:24,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-12-18 21:37:24,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-12-18 21:37:24,279 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:24,279 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:37:24,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-18 21:37:24,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-12-18 21:37:24,501 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:24,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:24,501 INFO L85 PathProgramCache]: Analyzing trace with hash -136678670, now seen corresponding path program 1 times [2021-12-18 21:37:24,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:24,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789514653] [2021-12-18 21:37:24,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:24,502 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:37:24,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:24,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789514653] [2021-12-18 21:37:24,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789514653] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:24,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:24,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:37:24,522 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131111207] [2021-12-18 21:37:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:24,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:37:24,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:37:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:37:24,522 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:24,543 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2021-12-18 21:37:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:37:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-12-18 21:37:24,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:24,544 INFO L225 Difference]: With dead ends: 130 [2021-12-18 21:37:24,544 INFO L226 Difference]: Without dead ends: 130 [2021-12-18 21:37:24,544 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:37:24,544 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:24,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 90 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:37:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-12-18 21:37:24,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2021-12-18 21:37:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 108 states have (on average 1.287037037037037) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2021-12-18 21:37:24,547 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 26 [2021-12-18 21:37:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:24,547 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2021-12-18 21:37:24,548 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2021-12-18 21:37:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 21:37:24,548 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:24,549 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-18 21:37:24,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-18 21:37:24,549 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:24,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1795791349, now seen corresponding path program 1 times [2021-12-18 21:37:24,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:24,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675270908] [2021-12-18 21:37:24,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:24,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:37:24,584 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:24,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675270908] [2021-12-18 21:37:24,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675270908] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:37:24,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:37:24,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:37:24,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119820580] [2021-12-18 21:37:24,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:37:24,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:37:24,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:24,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:37:24,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:37:24,586 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:24,628 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2021-12-18 21:37:24,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:37:24,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 21:37:24,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:24,629 INFO L225 Difference]: With dead ends: 138 [2021-12-18 21:37:24,629 INFO L226 Difference]: Without dead ends: 138 [2021-12-18 21:37:24,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:37:24,629 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:24,630 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 211 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:37:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2021-12-18 21:37:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2021-12-18 21:37:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 111 states have (on average 1.2792792792792793) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2021-12-18 21:37:24,632 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 28 [2021-12-18 21:37:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:24,632 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2021-12-18 21:37:24,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2021-12-18 21:37:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 21:37:24,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:24,633 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1] [2021-12-18 21:37:24,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-18 21:37:24,633 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:24,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:24,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1776841875, now seen corresponding path program 1 times [2021-12-18 21:37:24,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:24,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825777704] [2021-12-18 21:37:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:24,634 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:24,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:24,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825777704] [2021-12-18 21:37:24,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825777704] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:24,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780861624] [2021-12-18 21:37:24,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:24,728 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:24,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:24,729 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) [2021-12-18 21:37:24,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-18 21:37:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:24,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-18 21:37:24,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:24,797 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:24,800 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:24,812 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 21:37:24,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:37:24,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:24,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:37:24,879 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:24,885 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:24,901 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:37:24,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:25,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:37:25,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780861624] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:25,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:25,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 9 [2021-12-18 21:37:25,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317660023] [2021-12-18 21:37:25,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:25,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-18 21:37:25,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:25,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-18 21:37:25,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:37:25,008 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:25,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:25,315 INFO L93 Difference]: Finished difference Result 180 states and 192 transitions. [2021-12-18 21:37:25,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-18 21:37:25,315 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 21:37:25,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:25,316 INFO L225 Difference]: With dead ends: 180 [2021-12-18 21:37:25,316 INFO L226 Difference]: Without dead ends: 180 [2021-12-18 21:37:25,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2021-12-18 21:37:25,317 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 78 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:25,317 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 387 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:37:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-12-18 21:37:25,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2021-12-18 21:37:25,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 122 states have (on average 1.2704918032786885) internal successors, (155), 143 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:25,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 155 transitions. [2021-12-18 21:37:25,319 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 155 transitions. Word has length 29 [2021-12-18 21:37:25,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:25,319 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 155 transitions. [2021-12-18 21:37:25,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:25,319 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 155 transitions. [2021-12-18 21:37:25,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 21:37:25,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:25,320 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1] [2021-12-18 21:37:25,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-18 21:37:25,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:25,528 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:25,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:25,528 INFO L85 PathProgramCache]: Analyzing trace with hash 752476291, now seen corresponding path program 1 times [2021-12-18 21:37:25,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:25,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428309270] [2021-12-18 21:37:25,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:25,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:25,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:25,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:37:25,556 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428309270] [2021-12-18 21:37:25,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428309270] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:25,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981982134] [2021-12-18 21:37:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:25,557 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:25,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:25,557 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) [2021-12-18 21:37:25,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-18 21:37:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:25,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-18 21:37:25,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:25,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 15 treesize of output 5 [2021-12-18 21:37:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:37:25,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:25,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:37:25,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981982134] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:25,813 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:25,813 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2021-12-18 21:37:25,813 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301792164] [2021-12-18 21:37:25,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:25,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:37:25,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:25,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:37:25,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:37:25,814 INFO L87 Difference]: Start difference. First operand 144 states and 155 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:25,874 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2021-12-18 21:37:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:37:25,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 21:37:25,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:25,875 INFO L225 Difference]: With dead ends: 152 [2021-12-18 21:37:25,875 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 21:37:25,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:37:25,875 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:25,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2021-12-18 21:37:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 21:37:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-18 21:37:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2021-12-18 21:37:25,878 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 30 [2021-12-18 21:37:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:25,878 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2021-12-18 21:37:25,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2021-12-18 21:37:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 21:37:25,878 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:25,878 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:37:25,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-18 21:37:26,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-12-18 21:37:26,091 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:26,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:26,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230200, now seen corresponding path program 1 times [2021-12-18 21:37:26,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:26,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852559860] [2021-12-18 21:37:26,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:26,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:26,206 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852559860] [2021-12-18 21:37:26,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852559860] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:26,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379024609] [2021-12-18 21:37:26,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:26,207 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:26,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:26,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:37:26,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-18 21:37:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:26,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 33 conjunts are in the unsatisfiable core [2021-12-18 21:37:26,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:26,301 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:26,359 INFO L354 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2021-12-18 21:37:26,359 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:26,390 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:26,499 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:37:26,500 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 21:37:26,554 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:37:26,554 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 28 treesize of output 29 [2021-12-18 21:37:26,688 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:26,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2021-12-18 21:37:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:26,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:27,043 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:27,043 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 21 [2021-12-18 21:37:27,050 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:27,050 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 37 [2021-12-18 21:37:27,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 9 [2021-12-18 21:37:27,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:27,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379024609] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:27,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:27,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-18 21:37:27,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208548683] [2021-12-18 21:37:27,922 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:27,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-18 21:37:27,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:27,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-18 21:37:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=734, Unknown=7, NotChecked=0, Total=870 [2021-12-18 21:37:27,923 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:28,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:28,287 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2021-12-18 21:37:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 21:37:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 21:37:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:28,288 INFO L225 Difference]: With dead ends: 199 [2021-12-18 21:37:28,288 INFO L226 Difference]: Without dead ends: 199 [2021-12-18 21:37:28,289 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=244, Invalid=1081, Unknown=7, NotChecked=0, Total=1332 [2021-12-18 21:37:28,289 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 418 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 709 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:28,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 523 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 510 Invalid, 0 Unknown, 709 Unchecked, 0.2s Time] [2021-12-18 21:37:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-18 21:37:28,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 137. [2021-12-18 21:37:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 115 states have (on average 1.2956521739130435) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2021-12-18 21:37:28,291 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 30 [2021-12-18 21:37:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:28,291 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2021-12-18 21:37:28,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2021-12-18 21:37:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 21:37:28,292 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:28,292 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:37:28,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-18 21:37:28,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2021-12-18 21:37:28,495 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2041230201, now seen corresponding path program 1 times [2021-12-18 21:37:28,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:28,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393103528] [2021-12-18 21:37:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:28,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:28,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:28,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:28,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393103528] [2021-12-18 21:37:28,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393103528] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:28,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609734212] [2021-12-18 21:37:28,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:28,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:28,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:28,645 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:37:28,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-18 21:37:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:28,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 44 conjunts are in the unsatisfiable core [2021-12-18 21:37:28,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:28,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:28,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:28,811 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:28,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:28,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:28,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:28,952 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:37:28,952 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 21:37:28,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:28,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 21:37:29,016 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:37:29,017 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 21:37:29,027 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-18 21:37:29,147 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:29,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:29,151 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:29,152 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:29,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 16 [2021-12-18 21:37:29,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:29,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:29,655 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:29,656 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 51 [2021-12-18 21:37:29,659 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:29,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 51 [2021-12-18 21:37:29,667 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:29,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 74 treesize of output 77 [2021-12-18 21:37:29,678 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:29,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 125 treesize of output 120 [2021-12-18 21:37:29,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 89 treesize of output 85 [2021-12-18 21:37:29,687 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 85 treesize of output 81 [2021-12-18 21:37:29,690 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 81 treesize of output 79 [2021-12-18 21:37:30,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:30,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609734212] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:30,061 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:30,061 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2021-12-18 21:37:30,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722909770] [2021-12-18 21:37:30,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:30,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-18 21:37:30,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:30,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-18 21:37:30,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=768, Unknown=4, NotChecked=0, Total=870 [2021-12-18 21:37:30,064 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:30,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|)) (.cse0 (select .cse6 0)) (.cse3 (select .cse6 |c_ULTIMATE.start_main_~end~0#1.offset|))) (and (= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~end~0#1.offset|) (not (= |c_ULTIMATE.start_main_~end~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_74| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_74| 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|))) (and (<= (+ .cse1 8) (select |c_#length| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|))) (<= 0 (+ .cse1 4)))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_74|))) (= (select .cse2 0) 0) (= 1 (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select .cse2 |c_ULTIMATE.start_main_~end~0#1.offset|) 0) (<= 8 (select |c_#length| .cse0)) (not (= |c_ULTIMATE.start_main_~end~0#1.base| .cse3)) (<= 8 (select |c_#length| .cse3)) (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~end~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_14| Int)) (or (let ((.cse4 (< |c_ULTIMATE.start_main_~list~0#1.offset| 0))) (and (or .cse4 (= |c_ULTIMATE.start_main_~end~0#1.base| |c_ULTIMATE.start_main_~list~0#1.base|)) (or .cse4 (<= |c_ULTIMATE.start_main_~list~0#1.offset| |c_ULTIMATE.start_main_~end~0#1.offset|)) (or .cse4 (<= |c_ULTIMATE.start_main_~end~0#1.offset| 0)) (or .cse4 (not (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_14|))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_14|))))) (<= |c_ULTIMATE.start_main_~end~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~end~0#1.offset_74| Int)) (or (< |v_ULTIMATE.start_main_~end~0#1.offset_74| 0) (and (forall ((v_ArrVal_569 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_569) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|) 4))) (forall ((v_ArrVal_569 (Array Int Int)) (v_ArrVal_570 (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_569) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_570) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_74|)))))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_74|)))))) is different from false [2021-12-18 21:37:30,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:30,965 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2021-12-18 21:37:30,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-18 21:37:30,966 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 21:37:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:30,966 INFO L225 Difference]: With dead ends: 185 [2021-12-18 21:37:30,966 INFO L226 Difference]: Without dead ends: 185 [2021-12-18 21:37:30,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=1958, Unknown=5, NotChecked=92, Total=2352 [2021-12-18 21:37:30,967 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 189 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:30,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [189 Valid, 912 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1097 Invalid, 0 Unknown, 471 Unchecked, 0.5s Time] [2021-12-18 21:37:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-12-18 21:37:30,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 140. [2021-12-18 21:37:30,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.2881355932203389) internal successors, (152), 139 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:30,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2021-12-18 21:37:30,969 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 30 [2021-12-18 21:37:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:30,969 INFO L470 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2021-12-18 21:37:30,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.9310344827586206) internal successors, (85), 30 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:30,970 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2021-12-18 21:37:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-18 21:37:30,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:30,970 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:30,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:37:31,175 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:31,175 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -862773577, now seen corresponding path program 1 times [2021-12-18 21:37:31,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:31,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794409826] [2021-12-18 21:37:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:31,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:31,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:31,427 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794409826] [2021-12-18 21:37:31,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794409826] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:31,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537949398] [2021-12-18 21:37:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:31,427 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:31,428 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:37:31,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-18 21:37:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:31,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-18 21:37:31,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:31,517 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:31,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:37:31,563 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:31,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:31,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:31,576 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:37:31,582 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:31,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2021-12-18 21:37:31,659 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:31,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:31,708 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:31,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:31,723 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:31,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-12-18 21:37:31,759 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 21:37:31,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:31,789 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:31,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:31,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:31,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:31,880 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:31,890 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:31,894 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_692 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:31,904 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:31,941 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_692 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_11|))))) is different from false [2021-12-18 21:37:32,026 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:37:32,026 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 21:37:32,034 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_682)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_11| |c_ULTIMATE.start_main_~end~0#1.base|))) is different from false [2021-12-18 21:37:32,145 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_11| Int) (v_ArrVal_688 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_17| Int) (|v_ULTIMATE.start_main_~end~0#1.offset_81| Int) (v_ArrVal_682 Int) (v_ArrVal_692 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_17|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_81| v_ArrVal_682)) |v_ULTIMATE.start_main_#t~malloc3#1.base_17| v_ArrVal_688) |v_ULTIMATE.start_main_#t~malloc6#1.base_11| v_ArrVal_692) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_11| |c_ULTIMATE.start_main_~list~0#1.base|) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_81|))) is different from false [2021-12-18 21:37:32,154 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:32,158 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:32,158 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-18 21:37:32,161 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:32,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-18 21:37:32,165 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 21:37:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:32,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537949398] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:32,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:32,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 32 [2021-12-18 21:37:32,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373005785] [2021-12-18 21:37:32,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:32,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-18 21:37:32,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:32,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-18 21:37:32,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=486, Unknown=17, NotChecked=364, Total=992 [2021-12-18 21:37:32,182 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:32,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:32,868 INFO L93 Difference]: Finished difference Result 368 states and 400 transitions. [2021-12-18 21:37:32,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 21:37:32,874 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-12-18 21:37:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:32,875 INFO L225 Difference]: With dead ends: 368 [2021-12-18 21:37:32,875 INFO L226 Difference]: Without dead ends: 368 [2021-12-18 21:37:32,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=330, Invalid=1241, Unknown=17, NotChecked=574, Total=2162 [2021-12-18 21:37:32,876 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 560 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1868 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:32,876 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [560 Valid, 639 Invalid, 2625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 643 Invalid, 0 Unknown, 1868 Unchecked, 0.3s Time] [2021-12-18 21:37:32,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2021-12-18 21:37:32,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 155. [2021-12-18 21:37:32,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.263157894736842) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:32,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2021-12-18 21:37:32,879 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 30 [2021-12-18 21:37:32,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:32,879 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2021-12-18 21:37:32,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 32 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:32,880 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2021-12-18 21:37:32,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-12-18 21:37:32,880 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:32,880 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:32,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-18 21:37:33,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:33,093 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:33,094 INFO L85 PathProgramCache]: Analyzing trace with hash 20301398, now seen corresponding path program 2 times [2021-12-18 21:37:33,094 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:33,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604364020] [2021-12-18 21:37:33,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:33,094 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:33,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:33,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:33,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604364020] [2021-12-18 21:37:33,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604364020] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:33,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402679689] [2021-12-18 21:37:33,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:37:33,335 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:33,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:33,336 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:37:33,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-18 21:37:33,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:37:33,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:37:33,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-18 21:37:33,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:33,443 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:33,453 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:37:33,498 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:33,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:33,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:33,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:37:33,530 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:33,587 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2021-12-18 21:37:33,616 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:33,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:33,666 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:33,666 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:33,676 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:33,679 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-12-18 21:37:33,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 21:37:33,728 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:33,747 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:37:33,777 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:33,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:33,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:33,817 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:33,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_814 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:33,827 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (v_ArrVal_814 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:37:33,966 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:37:33,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2021-12-18 21:37:34,120 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_811 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_86| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_22| Int) (v_ArrVal_814 (Array Int Int)) (v_ArrVal_804 Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| Int)) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_86|) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_20| |c_ULTIMATE.start_main_~list~0#1.base|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_22|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_86| v_ArrVal_804)) |v_ULTIMATE.start_main_#t~malloc3#1.base_22| v_ArrVal_811) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_814) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 4)) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:37:34,136 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:34,140 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:34,140 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-18 21:37:34,144 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:34,145 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-18 21:37:34,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 21:37:34,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2021-12-18 21:37:34,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402679689] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:34,167 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:34,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 34 [2021-12-18 21:37:34,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191307338] [2021-12-18 21:37:34,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:34,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2021-12-18 21:37:34,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:34,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-12-18 21:37:34,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=637, Unknown=39, NotChecked=290, Total=1122 [2021-12-18 21:37:34,169 INFO L87 Difference]: Start difference. First operand 155 states and 168 transitions. Second operand has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:34,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:34,729 INFO L93 Difference]: Finished difference Result 313 states and 339 transitions. [2021-12-18 21:37:34,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2021-12-18 21:37:34,729 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2021-12-18 21:37:34,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:34,730 INFO L225 Difference]: With dead ends: 313 [2021-12-18 21:37:34,730 INFO L226 Difference]: Without dead ends: 313 [2021-12-18 21:37:34,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 11 SemanticMatches, 46 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=1414, Unknown=53, NotChecked=430, Total=2256 [2021-12-18 21:37:34,731 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 327 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1175 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:34,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [327 Valid, 667 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 548 Invalid, 0 Unknown, 1175 Unchecked, 0.3s Time] [2021-12-18 21:37:34,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2021-12-18 21:37:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 163. [2021-12-18 21:37:34,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 141 states have (on average 1.2553191489361701) internal successors, (177), 162 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:34,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2021-12-18 21:37:34,734 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 33 [2021-12-18 21:37:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:34,734 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2021-12-18 21:37:34,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2058823529411766) internal successors, (75), 34 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:34,735 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2021-12-18 21:37:34,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 21:37:34,735 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:34,735 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1] [2021-12-18 21:37:34,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:37:34,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-12-18 21:37:34,951 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:34,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1167746943, now seen corresponding path program 1 times [2021-12-18 21:37:34,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:34,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394791397] [2021-12-18 21:37:34,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:34,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:35,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:35,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394791397] [2021-12-18 21:37:35,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394791397] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:35,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304933415] [2021-12-18 21:37:35,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:35,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:35,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:35,184 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:37:35,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-18 21:37:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:35,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 53 conjunts are in the unsatisfiable core [2021-12-18 21:37:35,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:35,273 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:35,320 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:35,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:35,336 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:35,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:35,435 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:37:35,435 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 25 [2021-12-18 21:37:35,439 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-18 21:37:35,461 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:37:35,462 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-18 21:37:35,505 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:37:35,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 48 treesize of output 45 [2021-12-18 21:37:35,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-18 21:37:35,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2021-12-18 21:37:35,637 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:35,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:37:35,639 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:35,641 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:35,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 18 [2021-12-18 21:37:35,702 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:35,703 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:35,704 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 10 [2021-12-18 21:37:35,725 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:35,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:35,932 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 62 [2021-12-18 21:37:35,995 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (and (= .cse0 |c_ULTIMATE.start_main_~end~0#1.offset|) (forall ((v_ArrVal_893 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) |c_ULTIMATE.start_main_~end~0#1.base|))) (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_90|) (< |v_ULTIMATE.start_main_~end~0#1.offset_90| 0) (< .cse0 0)))) is different from false [2021-12-18 21:37:36,257 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_90|) (< .cse0 0) (let ((.cse1 (< |c_ULTIMATE.start_main_#t~mem4#1.offset| 0))) (and (<= |c_ULTIMATE.start_main_#t~mem4#1.offset| .cse0) (or .cse1 (forall ((v_ArrVal_893 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) |c_ULTIMATE.start_main_#t~mem4#1.base|))) (or .cse1 (<= .cse0 0)))) (< |v_ULTIMATE.start_main_~end~0#1.offset_90| 0)))) is different from false [2021-12-18 21:37:36,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_891 (Array Int Int)) (|v_ULTIMATE.start_main_~end~0#1.offset_90| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_891) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|))) (or (< |c_ULTIMATE.start_main_~list~0#1.offset| |v_ULTIMATE.start_main_~end~0#1.offset_90|) (< .cse0 0) (let ((.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (let ((.cse2 (< .cse1 0))) (and (<= .cse1 .cse0) (or (<= .cse0 0) .cse2) (or (forall ((v_ArrVal_893 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_893) |c_ULTIMATE.start_main_~list~0#1.base|) |v_ULTIMATE.start_main_~end~0#1.offset_90|) .cse3))) .cse2)))) (< |v_ULTIMATE.start_main_~end~0#1.offset_90| 0)))) is different from false [2021-12-18 21:37:36,459 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:36,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 66 [2021-12-18 21:37:36,463 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:36,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 66 [2021-12-18 21:37:36,469 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:36,470 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 100 treesize of output 95 [2021-12-18 21:37:36,477 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:36,477 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 106 treesize of output 109 [2021-12-18 21:37:36,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 109 treesize of output 103 [2021-12-18 21:37:36,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 57 treesize of output 55 [2021-12-18 21:37:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:36,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304933415] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:37:36,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-18 21:37:36,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 15] total 38 [2021-12-18 21:37:36,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625023231] [2021-12-18 21:37:36,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-18 21:37:36,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2021-12-18 21:37:36,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:37:36,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2021-12-18 21:37:36,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1081, Unknown=5, NotChecked=204, Total=1406 [2021-12-18 21:37:36,843 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:37:37,833 INFO L93 Difference]: Finished difference Result 235 states and 253 transitions. [2021-12-18 21:37:37,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-18 21:37:37,835 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-18 21:37:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:37:37,836 INFO L225 Difference]: With dead ends: 235 [2021-12-18 21:37:37,836 INFO L226 Difference]: Without dead ends: 235 [2021-12-18 21:37:37,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=339, Invalid=2118, Unknown=5, NotChecked=294, Total=2756 [2021-12-18 21:37:37,837 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 233 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:37:37,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1060 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1130 Invalid, 0 Unknown, 678 Unchecked, 0.4s Time] [2021-12-18 21:37:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2021-12-18 21:37:37,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 162. [2021-12-18 21:37:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.25) internal successors, (175), 161 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 175 transitions. [2021-12-18 21:37:37,840 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 175 transitions. Word has length 35 [2021-12-18 21:37:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:37:37,840 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 175 transitions. [2021-12-18 21:37:37,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.3157894736842106) internal successors, (88), 38 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:37:37,840 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 175 transitions. [2021-12-18 21:37:37,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-18 21:37:37,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:37:37,841 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:37:37,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:37:38,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:38,058 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:37:38,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:37:38,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1209765196, now seen corresponding path program 2 times [2021-12-18 21:37:38,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:37:38,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935088817] [2021-12-18 21:37:38,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:37:38,059 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:37:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:37:38,229 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:38,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:37:38,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935088817] [2021-12-18 21:37:38,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935088817] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:37:38,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357416857] [2021-12-18 21:37:38,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:37:38,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:37:38,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:37:38,231 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:37:38,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-18 21:37:38,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:37:38,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:37:38,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 61 conjunts are in the unsatisfiable core [2021-12-18 21:37:38,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:37:38,321 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:38,382 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:37:38,383 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:37:38,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:37:38,414 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:37:38,520 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 21:37:38,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-18 21:37:38,526 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 21 [2021-12-18 21:37:38,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:38,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:37:38,612 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:38,614 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 21:37:38,614 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2021-12-18 21:37:38,622 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-18 21:37:38,622 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2021-12-18 21:37:39,050 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:39,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:39,051 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:39,056 INFO L354 Elim1Store]: treesize reduction 38, result has 7.3 percent of original size [2021-12-18 21:37:39,057 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 42 [2021-12-18 21:37:39,059 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:39,062 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:37:39,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2021-12-18 21:37:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:37:39,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:37:45,717 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:37:45,718 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 114292 treesize of output 102937 [2021-12-18 21:37:49,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:49,570 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:37:50,824 INFO L354 Elim1Store]: treesize reduction 624, result has 48.3 percent of original size [2021-12-18 21:37:50,825 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 689916 treesize of output 661701 [2021-12-18 21:38:27,333 WARN L227 SmtUtils]: Spent 36.50s on a formula simplification. DAG size of input: 1410 DAG size of output: 1380 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 21:38:27,460 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:38:27,461 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 602833 treesize of output 602669 [2021-12-18 21:38:52,580 WARN L227 SmtUtils]: Spent 22.96s on a formula simplification. DAG size of input: 1402 DAG size of output: 1402 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 21:38:52,734 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 21:38:52,734 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 21:38:52,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-18 21:38:52,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966003415] [2021-12-18 21:38:52,735 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 21:38:52,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 21:38:52,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 21:38:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=896, Unknown=3, NotChecked=0, Total=992 [2021-12-18 21:38:52,736 INFO L87 Difference]: Start difference. First operand 162 states and 175 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:53,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:53,355 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2021-12-18 21:38:53,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 21:38:53,355 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-12-18 21:38:53,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:53,356 INFO L225 Difference]: With dead ends: 191 [2021-12-18 21:38:53,356 INFO L226 Difference]: Without dead ends: 191 [2021-12-18 21:38:53,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=203, Invalid=1956, Unknown=3, NotChecked=0, Total=2162 [2021-12-18 21:38:53,357 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 249 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:53,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 477 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:38:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2021-12-18 21:38:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 164. [2021-12-18 21:38:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.2464788732394365) internal successors, (177), 163 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:53,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2021-12-18 21:38:53,359 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 35 [2021-12-18 21:38:53,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:53,359 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2021-12-18 21:38:53,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:53,360 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2021-12-18 21:38:53,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 21:38:53,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:53,360 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:53,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-12-18 21:38:53,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-12-18 21:38:53,576 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:38:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1503597832, now seen corresponding path program 1 times [2021-12-18 21:38:53,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-18 21:38:53,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743316631] [2021-12-18 21:38:53,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:53,576 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-18 21:38:53,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:53,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:38:53,767 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-18 21:38:53,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743316631] [2021-12-18 21:38:53,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743316631] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-18 21:38:53,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896856757] [2021-12-18 21:38:53,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:53,767 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:38:53,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:38:53,768 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:38:53,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-18 21:38:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:53,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-18 21:38:53,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:53,878 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:38:53,934 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:38:53,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:38:53,958 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:38:54,056 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:38:54,056 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-18 21:38:54,103 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:38:54,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-18 21:38:54,123 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:38:54,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-18 21:38:54,159 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 21:38:54,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-18 21:38:54,265 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-18 21:38:54,266 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2021-12-18 21:38:54,274 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2021-12-18 21:38:54,329 INFO L354 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2021-12-18 21:38:54,330 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2021-12-18 21:38:54,332 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Should have been eliminated by DER [2021-12-18 21:38:54,332 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-18 21:38:54,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-12-18 21:38:54,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459248007] [2021-12-18 21:38:54,333 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-18 21:38:54,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-18 21:38:54,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-18 21:38:54,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-18 21:38:54,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2021-12-18 21:38:54,334 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 16 states, 15 states have (on average 2.466666666666667) internal successors, (37), 16 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:54,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-18 21:38:54,334 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2021-12-18 21:38:54,334 INFO L933 BasicCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:54,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:38:54,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-12-18 21:38:54,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-12-18 21:38:54,547 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7a773540 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:455) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) [2021-12-18 21:38:54,550 INFO L158 Benchmark]: Toolchain (without parser) took 95617.14ms. Allocated memory was 88.1MB in the beginning and 520.1MB in the end (delta: 432.0MB). Free memory was 53.3MB in the beginning and 292.7MB in the end (delta: -239.4MB). Peak memory consumption was 191.6MB. Max. memory is 16.1GB. [2021-12-18 21:38:54,550 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:38:54,550 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.37ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.1MB in the beginning and 75.6MB in the end (delta: -22.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-18 21:38:54,550 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.93ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 73.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:38:54,550 INFO L158 Benchmark]: Boogie Preprocessor took 21.89ms. Allocated memory is still 107.0MB. Free memory was 73.4MB in the beginning and 71.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:38:54,550 INFO L158 Benchmark]: RCFGBuilder took 362.71ms. Allocated memory is still 107.0MB. Free memory was 71.6MB in the beginning and 80.7MB in the end (delta: -9.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2021-12-18 21:38:54,550 INFO L158 Benchmark]: TraceAbstraction took 94862.81ms. Allocated memory was 107.0MB in the beginning and 520.1MB in the end (delta: 413.1MB). Free memory was 83.1MB in the beginning and 292.7MB in the end (delta: -209.5MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. [2021-12-18 21:38:54,551 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.14ms. Allocated memory is still 88.1MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 321.37ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 53.1MB in the beginning and 75.6MB in the end (delta: -22.5MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.93ms. Allocated memory is still 107.0MB. Free memory was 75.6MB in the beginning and 73.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.89ms. Allocated memory is still 107.0MB. Free memory was 73.4MB in the beginning and 71.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.71ms. Allocated memory is still 107.0MB. Free memory was 71.6MB in the beginning and 80.7MB in the end (delta: -9.1MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * TraceAbstraction took 94862.81ms. Allocated memory was 107.0MB in the beginning and 520.1MB in the end (delta: 413.1MB). Free memory was 83.1MB in the beginning and 292.7MB in the end (delta: -209.5MB). Peak memory consumption was 203.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7a773540 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@7a773540: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-18 21:38:54,567 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 21:38:56,174 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 21:38:56,176 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 21:38:56,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 21:38:56,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 21:38:56,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 21:38:56,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 21:38:56,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 21:38:56,218 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 21:38:56,222 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 21:38:56,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 21:38:56,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 21:38:56,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 21:38:56,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 21:38:56,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 21:38:56,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 21:38:56,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 21:38:56,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 21:38:56,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 21:38:56,241 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 21:38:56,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 21:38:56,246 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 21:38:56,247 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 21:38:56,248 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 21:38:56,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 21:38:56,250 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 21:38:56,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 21:38:56,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 21:38:56,252 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 21:38:56,253 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 21:38:56,253 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 21:38:56,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 21:38:56,254 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 21:38:56,255 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 21:38:56,256 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 21:38:56,256 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 21:38:56,257 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 21:38:56,257 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 21:38:56,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 21:38:56,258 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 21:38:56,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 21:38:56,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 21:38:56,284 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 21:38:56,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 21:38:56,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 21:38:56,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 21:38:56,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 21:38:56,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 21:38:56,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 21:38:56,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 21:38:56,288 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 21:38:56,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 21:38:56,288 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 21:38:56,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 21:38:56,290 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 21:38:56,290 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 21:38:56,290 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 21:38:56,290 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 21:38:56,290 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 21:38:56,290 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 21:38:56,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 21:38:56,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 21:38:56,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:38:56,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 21:38:56,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 21:38:56,291 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 21:38:56,291 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 21:38:56,292 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 21:38:56,292 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 21:38:56,292 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6070ac475d5b3c3d5905eb0c203232134efabc1c427fcfbbf8cf82789693617b [2021-12-18 21:38:56,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 21:38:56,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 21:38:56,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 21:38:56,575 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 21:38:56,578 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 21:38:56,580 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-18 21:38:56,630 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed36d13d/d45586b40dc140cc95fe59cb610d01b4/FLAG1e5aa8f96 [2021-12-18 21:38:56,990 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 21:38:56,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-rb-cnstr_1-1.i [2021-12-18 21:38:57,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed36d13d/d45586b40dc140cc95fe59cb610d01b4/FLAG1e5aa8f96 [2021-12-18 21:38:57,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed36d13d/d45586b40dc140cc95fe59cb610d01b4 [2021-12-18 21:38:57,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 21:38:57,366 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 21:38:57,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 21:38:57,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 21:38:57,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 21:38:57,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b45ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57, skipping insertion in model container [2021-12-18 21:38:57,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,379 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 21:38:57,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 21:38:57,672 WARN L230 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/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-18 21:38:57,674 WARN L230 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/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-18 21:38:57,676 WARN L230 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/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-18 21:38:57,678 WARN L230 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/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-18 21:38:57,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:38:57,696 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 21:38:57,725 WARN L230 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/sll-rb-cnstr_1-1.i[22480,22493] [2021-12-18 21:38:57,728 WARN L230 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/sll-rb-cnstr_1-1.i[22552,22565] [2021-12-18 21:38:57,730 WARN L230 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/sll-rb-cnstr_1-1.i[22704,22717] [2021-12-18 21:38:57,732 WARN L230 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/sll-rb-cnstr_1-1.i[22778,22791] [2021-12-18 21:38:57,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 21:38:57,757 INFO L208 MainTranslator]: Completed translation [2021-12-18 21:38:57,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57 WrapperNode [2021-12-18 21:38:57,758 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 21:38:57,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 21:38:57,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 21:38:57,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 21:38:57,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,813 INFO L137 Inliner]: procedures = 122, calls = 32, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2021-12-18 21:38:57,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 21:38:57,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 21:38:57,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 21:38:57,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 21:38:57,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,833 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,834 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,849 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,854 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 21:38:57,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 21:38:57,863 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 21:38:57,863 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 21:38:57,864 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (1/1) ... [2021-12-18 21:38:57,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 21:38:57,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:38:57,885 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) [2021-12-18 21:38:57,893 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 [2021-12-18 21:38:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 21:38:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 21:38:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 21:38:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 21:38:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 21:38:57,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 21:38:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 21:38:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 21:38:57,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 21:38:57,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 21:38:58,017 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 21:38:58,018 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 21:38:58,333 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 21:38:58,337 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 21:38:58,337 INFO L301 CfgBuilder]: Removed 11 assume(true) statements. [2021-12-18 21:38:58,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:58 BoogieIcfgContainer [2021-12-18 21:38:58,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 21:38:58,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 21:38:58,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 21:38:58,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 21:38:58,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:38:57" (1/3) ... [2021-12-18 21:38:58,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6159b085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:58, skipping insertion in model container [2021-12-18 21:38:58,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:38:57" (2/3) ... [2021-12-18 21:38:58,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6159b085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:38:58, skipping insertion in model container [2021-12-18 21:38:58,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:58" (3/3) ... [2021-12-18 21:38:58,344 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-rb-cnstr_1-1.i [2021-12-18 21:38:58,347 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 21:38:58,347 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-12-18 21:38:58,376 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 21:38:58,381 INFO L339 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 21:38:58,381 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-12-18 21:38:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 64 states have (on average 2.171875) internal successors, (139), 118 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:58,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:38:58,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:58,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:38:58,400 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:38:58,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:58,406 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2021-12-18 21:38:58,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:58,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [964310923] [2021-12-18 21:38:58,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:58,425 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:58,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:58,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:38:58,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 21:38:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:58,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 21:38:58,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:58,552 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:38:58,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:38:58,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:58,564 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:58,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [964310923] [2021-12-18 21:38:58,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [964310923] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:58,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:58,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:38:58,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618364696] [2021-12-18 21:38:58,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:58,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:38:58,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:38:58,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:58,597 INFO L87 Difference]: Start difference. First operand has 119 states, 64 states have (on average 2.171875) internal successors, (139), 118 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:58,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:58,769 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2021-12-18 21:38:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:38:58,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 21:38:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:58,777 INFO L225 Difference]: With dead ends: 121 [2021-12-18 21:38:58,777 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 21:38:58,778 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:58,781 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:58,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 73 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:38:58,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 21:38:58,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2021-12-18 21:38:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 65 states have (on average 1.8461538461538463) internal successors, (120), 112 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:58,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-12-18 21:38:58,815 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 3 [2021-12-18 21:38:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:58,815 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-12-18 21:38:58,815 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:58,815 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-12-18 21:38:58,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-18 21:38:58,816 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:58,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-18 21:38:58,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-18 21:38:59,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:38:59,023 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:38:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:59,026 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2021-12-18 21:38:59,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:59,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826531481] [2021-12-18 21:38:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:59,033 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:59,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:59,034 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:38:59,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 21:38:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:59,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:38:59,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:59,088 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:38:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:38:59,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:59,097 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:59,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826531481] [2021-12-18 21:38:59,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826531481] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:59,098 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:59,098 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:38:59,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553389784] [2021-12-18 21:38:59,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:59,101 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:38:59,101 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:59,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:38:59,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:59,102 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:59,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:59,289 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2021-12-18 21:38:59,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:38:59,290 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-12-18 21:38:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:59,291 INFO L225 Difference]: With dead ends: 131 [2021-12-18 21:38:59,291 INFO L226 Difference]: Without dead ends: 131 [2021-12-18 21:38:59,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:38:59,292 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:59,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 78 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-12-18 21:38:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 118. [2021-12-18 21:38:59,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 72 states have (on average 1.7361111111111112) internal successors, (125), 117 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-12-18 21:38:59,297 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 3 [2021-12-18 21:38:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:59,298 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-12-18 21:38:59,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-12-18 21:38:59,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 21:38:59,298 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:59,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:59,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 21:38:59,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:38:59,505 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:38:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:38:59,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2021-12-18 21:38:59,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:38:59,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871583183] [2021-12-18 21:38:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:38:59,506 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:38:59,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:38:59,507 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:38:59,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 21:38:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:38:59,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:38:59,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:38:59,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:38:59,636 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-18 21:38:59,637 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-12-18 21:38:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:38:59,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:38:59,654 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:38:59,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871583183] [2021-12-18 21:38:59,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871583183] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:38:59,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:38:59,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:38:59,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901028789] [2021-12-18 21:38:59,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:38:59,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:38:59,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:38:59,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:38:59,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:38:59,658 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:38:59,876 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-12-18 21:38:59,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:38:59,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 21:38:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:38:59,877 INFO L225 Difference]: With dead ends: 123 [2021-12-18 21:38:59,877 INFO L226 Difference]: Without dead ends: 123 [2021-12-18 21:38:59,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:38:59,878 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 155 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:38:59,878 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 61 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:38:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-12-18 21:38:59,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2021-12-18 21:38:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 108 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2021-12-18 21:38:59,883 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 7 [2021-12-18 21:38:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:38:59,883 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2021-12-18 21:38:59,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:38:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2021-12-18 21:38:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-12-18 21:38:59,884 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:38:59,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:38:59,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:00,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:00,085 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:00,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:00,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2021-12-18 21:39:00,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:00,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809037899] [2021-12-18 21:39:00,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:00,086 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:00,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:00,087 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:00,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 21:39:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:00,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:39:00,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:00,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:00,204 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:39:00,204 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2021-12-18 21:39:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:00,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:00,215 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:00,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809037899] [2021-12-18 21:39:00,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809037899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:00,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:00,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 21:39:00,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339084528] [2021-12-18 21:39:00,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:00,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:39:00,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:00,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:39:00,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:39:00,217 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:00,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:00,462 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2021-12-18 21:39:00,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:39:00,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-12-18 21:39:00,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:00,463 INFO L225 Difference]: With dead ends: 142 [2021-12-18 21:39:00,463 INFO L226 Difference]: Without dead ends: 142 [2021-12-18 21:39:00,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:39:00,464 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 137 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:00,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 83 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:39:00,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-12-18 21:39:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2021-12-18 21:39:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 81 states have (on average 1.5432098765432098) internal successors, (125), 114 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 125 transitions. [2021-12-18 21:39:00,468 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 125 transitions. Word has length 7 [2021-12-18 21:39:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:00,469 INFO L470 AbstractCegarLoop]: Abstraction has 115 states and 125 transitions. [2021-12-18 21:39:00,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:00,469 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 125 transitions. [2021-12-18 21:39:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-18 21:39:00,469 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:00,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:00,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:00,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:00,676 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:00,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:00,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1837273936, now seen corresponding path program 1 times [2021-12-18 21:39:00,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:00,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575677550] [2021-12-18 21:39:00,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:00,677 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:00,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:00,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:00,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 21:39:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:00,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 21:39:00,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:00,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:00,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:00,741 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:00,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575677550] [2021-12-18 21:39:00,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575677550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:00,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:00,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:39:00,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882714814] [2021-12-18 21:39:00,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:00,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:39:00,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:00,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:39:00,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:39:00,743 INFO L87 Difference]: Start difference. First operand 115 states and 125 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:00,908 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2021-12-18 21:39:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:39:00,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-18 21:39:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:00,909 INFO L225 Difference]: With dead ends: 127 [2021-12-18 21:39:00,909 INFO L226 Difference]: Without dead ends: 127 [2021-12-18 21:39:00,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:39:00,910 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 109 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:00,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 129 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:39:00,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-12-18 21:39:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 113. [2021-12-18 21:39:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 80 states have (on average 1.5125) internal successors, (121), 112 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2021-12-18 21:39:00,915 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 9 [2021-12-18 21:39:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:00,916 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2021-12-18 21:39:00,916 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2021-12-18 21:39:00,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:39:00,916 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:00,916 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:00,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-12-18 21:39:01,121 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:01,122 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2021-12-18 21:39:01,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335376377] [2021-12-18 21:39:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:01,123 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:01,124 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:01,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 21:39:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:01,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:39:01,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:01,182 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:01,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:01,205 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 12 [2021-12-18 21:39:01,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:01,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:01,218 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:01,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335376377] [2021-12-18 21:39:01,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335376377] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:01,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:01,218 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:39:01,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648530906] [2021-12-18 21:39:01,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:01,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:39:01,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:01,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:39:01,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:39:01,219 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:01,540 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2021-12-18 21:39:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:39:01,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 21:39:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:01,541 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:39:01,541 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:39:01,541 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:39:01,542 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 45 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:01,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 236 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:39:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:39:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2021-12-18 21:39:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 80 states have (on average 1.5) internal successors, (120), 111 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2021-12-18 21:39:01,545 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 11 [2021-12-18 21:39:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:01,545 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2021-12-18 21:39:01,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:01,545 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2021-12-18 21:39:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-18 21:39:01,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:01,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:01,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:01,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:01,746 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2021-12-18 21:39:01,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:01,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [92337053] [2021-12-18 21:39:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:01,747 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:01,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:01,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:01,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 21:39:01,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:01,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 21:39:01,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:01,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:01,837 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:01,842 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:01,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:01,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2021-12-18 21:39:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:01,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:01,898 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:01,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [92337053] [2021-12-18 21:39:01,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [92337053] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:01,899 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:01,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:39:01,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837593583] [2021-12-18 21:39:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:01,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:39:01,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:39:01,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:39:01,900 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:02,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:02,244 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2021-12-18 21:39:02,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-18 21:39:02,245 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-12-18 21:39:02,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:02,246 INFO L225 Difference]: With dead ends: 113 [2021-12-18 21:39:02,246 INFO L226 Difference]: Without dead ends: 113 [2021-12-18 21:39:02,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2021-12-18 21:39:02,246 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:02,247 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 271 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:39:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-12-18 21:39:02,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2021-12-18 21:39:02,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 80 states have (on average 1.4375) internal successors, (115), 106 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2021-12-18 21:39:02,250 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 11 [2021-12-18 21:39:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:02,250 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2021-12-18 21:39:02,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2021-12-18 21:39:02,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 21:39:02,250 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:02,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:02,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:02,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:02,457 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:02,458 INFO L85 PathProgramCache]: Analyzing trace with hash -831409633, now seen corresponding path program 1 times [2021-12-18 21:39:02,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:02,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994042114] [2021-12-18 21:39:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:02,458 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:02,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:02,459 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:02,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 21:39:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:02,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:39:02,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:02,511 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:39:02,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-18 21:39:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:02,548 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:02,549 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:02,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994042114] [2021-12-18 21:39:02,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994042114] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:02,549 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:02,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:39:02,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454432278] [2021-12-18 21:39:02,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:02,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:39:02,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:02,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:39:02,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:39:02,550 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:02,798 INFO L93 Difference]: Finished difference Result 163 states and 176 transitions. [2021-12-18 21:39:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:39:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 21:39:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:02,799 INFO L225 Difference]: With dead ends: 163 [2021-12-18 21:39:02,799 INFO L226 Difference]: Without dead ends: 163 [2021-12-18 21:39:02,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:39:02,799 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 71 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:02,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 218 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:39:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2021-12-18 21:39:02,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 113. [2021-12-18 21:39:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2021-12-18 21:39:02,802 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 12 [2021-12-18 21:39:02,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:02,803 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2021-12-18 21:39:02,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2021-12-18 21:39:02,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:39:02,803 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:02,803 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:02,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:03,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:03,010 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:03,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:03,010 INFO L85 PathProgramCache]: Analyzing trace with hash 845868945, now seen corresponding path program 1 times [2021-12-18 21:39:03,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:03,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708576062] [2021-12-18 21:39:03,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:03,011 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:03,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:03,012 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:03,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 21:39:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:03,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 21:39:03,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:03,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:39:03,135 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-18 21:39:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:03,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:03,147 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:03,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708576062] [2021-12-18 21:39:03,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708576062] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:03,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:03,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:39:03,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385162841] [2021-12-18 21:39:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:03,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:39:03,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:39:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:39:03,149 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:03,392 INFO L93 Difference]: Finished difference Result 161 states and 173 transitions. [2021-12-18 21:39:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 21:39:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 21:39:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:03,394 INFO L225 Difference]: With dead ends: 161 [2021-12-18 21:39:03,394 INFO L226 Difference]: Without dead ends: 161 [2021-12-18 21:39:03,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-12-18 21:39:03,394 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 62 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:03,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 220 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:39:03,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2021-12-18 21:39:03,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 117. [2021-12-18 21:39:03,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.4) internal successors, (126), 116 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:03,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 126 transitions. [2021-12-18 21:39:03,397 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 126 transitions. Word has length 19 [2021-12-18 21:39:03,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:03,398 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 126 transitions. [2021-12-18 21:39:03,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:03,398 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 126 transitions. [2021-12-18 21:39:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:39:03,398 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:03,398 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:03,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:03,607 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:03,607 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:03,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:03,607 INFO L85 PathProgramCache]: Analyzing trace with hash 887887198, now seen corresponding path program 1 times [2021-12-18 21:39:03,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:03,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278885865] [2021-12-18 21:39:03,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:03,608 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:03,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:03,609 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:03,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 21:39:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:03,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-18 21:39:03,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:03,683 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:03,688 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:03,709 INFO L354 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2021-12-18 21:39:03,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:39:03,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:39:03,715 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:39:03,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:03,785 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:03,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:03,888 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:03,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278885865] [2021-12-18 21:39:03,888 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278885865] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:03,888 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:03,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2021-12-18 21:39:03,888 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849048721] [2021-12-18 21:39:03,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:03,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:39:03,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:03,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:39:03,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:39:03,890 INFO L87 Difference]: Start difference. First operand 117 states and 126 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:04,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:04,211 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2021-12-18 21:39:04,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-18 21:39:04,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 21:39:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:04,212 INFO L225 Difference]: With dead ends: 140 [2021-12-18 21:39:04,213 INFO L226 Difference]: Without dead ends: 140 [2021-12-18 21:39:04,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-18 21:39:04,213 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 53 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:04,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 251 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 21:39:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2021-12-18 21:39:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2021-12-18 21:39:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 119 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2021-12-18 21:39:04,216 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 19 [2021-12-18 21:39:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:04,216 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2021-12-18 21:39:04,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2021-12-18 21:39:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:39:04,216 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:04,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:04,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:04,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:04,423 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:04,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:04,423 INFO L85 PathProgramCache]: Analyzing trace with hash 214450347, now seen corresponding path program 1 times [2021-12-18 21:39:04,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:04,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537967511] [2021-12-18 21:39:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:04,424 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:04,424 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:04,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 21:39:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:04,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-18 21:39:04,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:04,516 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:04,534 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:04,547 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 12 [2021-12-18 21:39:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:04,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:04,561 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537967511] [2021-12-18 21:39:04,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537967511] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:04,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:04,562 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:39:04,562 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948590326] [2021-12-18 21:39:04,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:04,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:39:04,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:04,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:39:04,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:39:04,563 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:04,837 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2021-12-18 21:39:04,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:39:04,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 21:39:04,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:04,838 INFO L225 Difference]: With dead ends: 120 [2021-12-18 21:39:04,838 INFO L226 Difference]: Without dead ends: 120 [2021-12-18 21:39:04,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-18 21:39:04,839 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 39 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:04,839 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 233 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:39:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2021-12-18 21:39:04,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2021-12-18 21:39:04,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 118 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:04,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2021-12-18 21:39:04,841 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 19 [2021-12-18 21:39:04,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:04,841 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2021-12-18 21:39:04,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:04,841 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2021-12-18 21:39:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-18 21:39:04,841 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:04,841 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:04,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:05,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:05,049 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:05,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash 214450348, now seen corresponding path program 1 times [2021-12-18 21:39:05,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:05,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336756571] [2021-12-18 21:39:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:05,049 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:05,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:05,050 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:05,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 21:39:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:05,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 21:39:05,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:05,146 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:05,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:05,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:05,185 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2021-12-18 21:39:05,187 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:05,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:05,211 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:05,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336756571] [2021-12-18 21:39:05,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336756571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:05,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:05,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:39:05,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452147938] [2021-12-18 21:39:05,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:05,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:39:05,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:05,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:39:05,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:39:05,213 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:05,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:05,482 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2021-12-18 21:39:05,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 21:39:05,483 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-18 21:39:05,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:05,483 INFO L225 Difference]: With dead ends: 117 [2021-12-18 21:39:05,483 INFO L226 Difference]: Without dead ends: 117 [2021-12-18 21:39:05,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-18 21:39:05,484 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:05,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 278 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:39:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-12-18 21:39:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2021-12-18 21:39:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 110 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:05,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2021-12-18 21:39:05,486 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 19 [2021-12-18 21:39:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:05,486 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2021-12-18 21:39:05,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2021-12-18 21:39:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-18 21:39:05,486 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:05,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:05,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:05,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:05,687 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:05,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:05,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1792229925, now seen corresponding path program 1 times [2021-12-18 21:39:05,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:05,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603860841] [2021-12-18 21:39:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:05,688 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:05,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:05,689 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:05,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 21:39:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:05,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 22 conjunts are in the unsatisfiable core [2021-12-18 21:39:05,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:05,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:05,812 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:39:05,853 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:05,854 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:39:05,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:39:05,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:39:05,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:05,935 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2021-12-18 21:39:05,977 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:05,997 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:06,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:06,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:06,144 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:06,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:06,187 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_297) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:06,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (_ BitVec 32)) (v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_294)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_297) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:06,306 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_294 (_ BitVec 32)) (v_ArrVal_297 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_6| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_294)) |v_ULTIMATE.start_main_#t~malloc3#1.base_6| v_ArrVal_297) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:39:06,332 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-18 21:39:06,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 31 [2021-12-18 21:39:06,337 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2021-12-18 21:39:06,340 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 21:39:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:06,367 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:06,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603860841] [2021-12-18 21:39:06,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603860841] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:06,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:06,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2021-12-18 21:39:06,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603282529] [2021-12-18 21:39:06,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:06,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2021-12-18 21:39:06,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:06,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-18 21:39:06,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=186, Unknown=7, NotChecked=160, Total=420 [2021-12-18 21:39:06,368 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:07,223 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2021-12-18 21:39:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-18 21:39:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-12-18 21:39:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:07,225 INFO L225 Difference]: With dead ends: 187 [2021-12-18 21:39:07,225 INFO L226 Difference]: Without dead ends: 187 [2021-12-18 21:39:07,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=344, Unknown=7, NotChecked=220, Total=702 [2021-12-18 21:39:07,226 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 195 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 638 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:07,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 477 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 503 Invalid, 0 Unknown, 638 Unchecked, 0.6s Time] [2021-12-18 21:39:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2021-12-18 21:39:07,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 124. [2021-12-18 21:39:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.3137254901960784) internal successors, (134), 123 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2021-12-18 21:39:07,228 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 20 [2021-12-18 21:39:07,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:07,228 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2021-12-18 21:39:07,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 21 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2021-12-18 21:39:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:39:07,229 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:07,229 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:39:07,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:07,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:07,436 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1099601623, now seen corresponding path program 1 times [2021-12-18 21:39:07,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584313490] [2021-12-18 21:39:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:07,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:07,438 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:07,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 21:39:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:07,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-18 21:39:07,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:07,506 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:39:07,550 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-18 21:39:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:39:07,559 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:07,559 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:07,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [584313490] [2021-12-18 21:39:07,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [584313490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:07,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:07,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 21:39:07,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190616503] [2021-12-18 21:39:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:07,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 21:39:07,560 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:07,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 21:39:07,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 21:39:07,561 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:07,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:07,662 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2021-12-18 21:39:07,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:39:07,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-18 21:39:07,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:07,662 INFO L225 Difference]: With dead ends: 133 [2021-12-18 21:39:07,662 INFO L226 Difference]: Without dead ends: 133 [2021-12-18 21:39:07,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:39:07,663 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:07,663 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 203 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-18 21:39:07,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-12-18 21:39:07,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2021-12-18 21:39:07,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 105 states have (on average 1.3047619047619048) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-12-18 21:39:07,666 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 25 [2021-12-18 21:39:07,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:07,666 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-12-18 21:39:07,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:07,666 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-12-18 21:39:07,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-18 21:39:07,666 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:07,667 INFO L514 BasicCegarLoop]: 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] [2021-12-18 21:39:07,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:07,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:07,871 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1078606913, now seen corresponding path program 1 times [2021-12-18 21:39:07,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:07,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444938644] [2021-12-18 21:39:07,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:07,876 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:07,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:07,877 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:07,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-18 21:39:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:07,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-18 21:39:07,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:39:07,979 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:07,979 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:07,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444938644] [2021-12-18 21:39:07,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444938644] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:07,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:07,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 21:39:07,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995044146] [2021-12-18 21:39:07,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:07,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 21:39:07,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:07,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 21:39:07,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:39:07,980 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:08,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:08,024 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2021-12-18 21:39:08,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 21:39:08,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-12-18 21:39:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:08,025 INFO L225 Difference]: With dead ends: 129 [2021-12-18 21:39:08,025 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 21:39:08,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 21:39:08,025 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 46 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:08,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 93 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 21:39:08,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 21:39:08,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2021-12-18 21:39:08,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 128 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2021-12-18 21:39:08,027 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 25 [2021-12-18 21:39:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:08,028 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2021-12-18 21:39:08,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:08,028 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2021-12-18 21:39:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 21:39:08,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:08,028 INFO L514 BasicCegarLoop]: 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, 1] [2021-12-18 21:39:08,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:08,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:08,235 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:08,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1771731029, now seen corresponding path program 1 times [2021-12-18 21:39:08,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:08,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829189654] [2021-12-18 21:39:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:08,236 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:08,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:08,237 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:08,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-18 21:39:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:08,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 21:39:08,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:08,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-18 21:39:08,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:39:08,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 21:39:08,357 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:08,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829189654] [2021-12-18 21:39:08,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829189654] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 21:39:08,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:39:08,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 21:39:08,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12240963] [2021-12-18 21:39:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 21:39:08,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 21:39:08,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:08,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 21:39:08,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 21:39:08,359 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:08,521 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2021-12-18 21:39:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 21:39:08,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 21:39:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:08,522 INFO L225 Difference]: With dead ends: 129 [2021-12-18 21:39:08,522 INFO L226 Difference]: Without dead ends: 129 [2021-12-18 21:39:08,523 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-18 21:39:08,523 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 6 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:08,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 255 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 21:39:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-18 21:39:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2021-12-18 21:39:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 127 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2021-12-18 21:39:08,525 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 27 [2021-12-18 21:39:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:08,525 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2021-12-18 21:39:08,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2021-12-18 21:39:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 21:39:08,526 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:08,526 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-18 21:39:08,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:08,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:08,731 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:08,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:08,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1813749282, now seen corresponding path program 1 times [2021-12-18 21:39:08,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:08,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [291610661] [2021-12-18 21:39:08,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:08,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:08,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:08,733 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:08,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 21:39:08,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:08,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 21:39:08,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:08,845 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 21:39:08,845 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2021-12-18 21:39:08,930 INFO L354 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2021-12-18 21:39:08,931 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 47 [2021-12-18 21:39:08,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:09,138 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:39:09,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 52 treesize of output 48 [2021-12-18 21:39:09,197 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:39:09,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 49 treesize of output 48 [2021-12-18 21:39:09,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 30 [2021-12-18 21:39:09,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:09,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:09,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 21:39:09,632 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_401) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 21:39:09,639 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_401 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_401) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (_ bv1 1)))) is different from false [2021-12-18 21:39:09,649 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:09,649 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 23 [2021-12-18 21:39:09,659 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:09,660 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 38 treesize of output 41 [2021-12-18 21:39:09,667 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 11 [2021-12-18 21:39:20,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:20,006 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:20,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [291610661] [2021-12-18 21:39:20,007 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [291610661] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:20,007 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:20,007 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2021-12-18 21:39:20,007 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847329441] [2021-12-18 21:39:20,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:20,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-18 21:39:20,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:20,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-18 21:39:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=310, Unknown=5, NotChecked=114, Total=506 [2021-12-18 21:39:20,009 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:20,627 INFO L93 Difference]: Finished difference Result 174 states and 186 transitions. [2021-12-18 21:39:20,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:39:20,628 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 21:39:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:20,628 INFO L225 Difference]: With dead ends: 174 [2021-12-18 21:39:20,628 INFO L226 Difference]: Without dead ends: 174 [2021-12-18 21:39:20,629 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=156, Invalid=553, Unknown=5, NotChecked=156, Total=870 [2021-12-18 21:39:20,629 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 143 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:20,629 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 444 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 262 Invalid, 0 Unknown, 652 Unchecked, 0.4s Time] [2021-12-18 21:39:20,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2021-12-18 21:39:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 136. [2021-12-18 21:39:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 135 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:20,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2021-12-18 21:39:20,631 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 27 [2021-12-18 21:39:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:20,632 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2021-12-18 21:39:20,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2021-12-18 21:39:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 21:39:20,633 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:20,634 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-18 21:39:20,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:20,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:20,834 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:20,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:20,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1813749283, now seen corresponding path program 1 times [2021-12-18 21:39:20,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:20,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537379235] [2021-12-18 21:39:20,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:20,835 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:20,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:20,836 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:20,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-18 21:39:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:20,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 21:39:20,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:20,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:20,962 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:20,973 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:20,973 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:39:21,013 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:21,018 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:21,123 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:39:21,123 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 31 treesize of output 29 [2021-12-18 21:39:21,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:39:21,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 21:39:21,159 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:39:21,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 38 treesize of output 37 [2021-12-18 21:39:21,163 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 20 [2021-12-18 21:39:21,279 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 13 [2021-12-18 21:39:21,283 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:21,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:21,324 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:21,609 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_445) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) is different from false [2021-12-18 21:39:21,645 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_445) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-18 21:39:21,665 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_445) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2021-12-18 21:39:21,690 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_445 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_444) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_445) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))) is different from false [2021-12-18 21:39:21,709 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:21,710 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2021-12-18 21:39:21,723 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:21,724 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 44 treesize of output 43 [2021-12-18 21:39:21,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2021-12-18 21:39:21,769 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:21,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-18 21:39:21,780 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:21,780 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2021-12-18 21:39:21,782 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:39:21,786 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2021-12-18 21:39:21,788 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:39:21,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2021-12-18 21:39:21,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:21,923 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:21,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537379235] [2021-12-18 21:39:21,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537379235] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:21,923 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:21,924 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2021-12-18 21:39:21,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929697065] [2021-12-18 21:39:21,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:21,924 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-12-18 21:39:21,924 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:21,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-12-18 21:39:21,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=261, Unknown=4, NotChecked=140, Total=462 [2021-12-18 21:39:21,925 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:24,397 INFO L93 Difference]: Finished difference Result 199 states and 214 transitions. [2021-12-18 21:39:24,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-18 21:39:24,398 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 21:39:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:24,398 INFO L225 Difference]: With dead ends: 199 [2021-12-18 21:39:24,399 INFO L226 Difference]: Without dead ends: 199 [2021-12-18 21:39:24,399 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=164, Invalid=660, Unknown=4, NotChecked=228, Total=1056 [2021-12-18 21:39:24,399 INFO L933 BasicCegarLoop]: 64 mSDtfsCounter, 233 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:24,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 569 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 969 Invalid, 0 Unknown, 571 Unchecked, 1.5s Time] [2021-12-18 21:39:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2021-12-18 21:39:24,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 138. [2021-12-18 21:39:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 137 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2021-12-18 21:39:24,402 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 27 [2021-12-18 21:39:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:24,402 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2021-12-18 21:39:24,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2021-12-18 21:39:24,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 21:39:24,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:24,403 INFO L514 BasicCegarLoop]: 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, 1] [2021-12-18 21:39:24,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:24,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:24,610 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:24,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:24,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1873017417, now seen corresponding path program 1 times [2021-12-18 21:39:24,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:24,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442731876] [2021-12-18 21:39:24,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:24,611 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:24,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:24,612 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:24,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-18 21:39:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:24,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 21:39:24,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:24,755 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:24,768 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:39:24,816 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:24,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:39:24,849 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:24,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:39:24,858 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2021-12-18 21:39:24,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2021-12-18 21:39:24,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:24,967 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:24,987 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:24,987 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 21:39:25,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:25,031 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2021-12-18 21:39:25,074 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 21:39:25,122 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:25,132 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:25,186 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:25,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:25,278 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:25,288 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:25,294 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:25,305 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_509) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:25,378 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_9| (_ BitVec 32)) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_9|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_509) |v_ULTIMATE.start_main_#t~malloc6#1.base_9| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:39:25,411 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_9| (_ BitVec 32)) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_9|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_509) |v_ULTIMATE.start_main_#t~malloc6#1.base_9| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:39:25,426 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_9| (_ BitVec 32)) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_509) |v_ULTIMATE.start_main_#t~malloc6#1.base_9| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_9|))))) is different from false [2021-12-18 21:39:25,469 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:39:25,469 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 14 [2021-12-18 21:39:25,484 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (_ BitVec 32)) (v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc6#1.base_9| (_ BitVec 32)) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_505)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_509) |v_ULTIMATE.start_main_#t~malloc6#1.base_9| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK) (= |c_ULTIMATE.start_main_~end~0#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_9|))) is different from false [2021-12-18 21:39:25,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_505 (_ BitVec 32)) (v_ArrVal_509 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_15| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_9| (_ BitVec 32)) (v_ArrVal_513 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_15|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_505)) |v_ULTIMATE.start_main_#t~malloc3#1.base_15| v_ArrVal_509) |v_ULTIMATE.start_main_#t~malloc6#1.base_9| v_ArrVal_513) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc6#1.base_9|))) is different from false [2021-12-18 21:39:25,668 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-18 21:39:25,669 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-18 21:39:25,673 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:39:25,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-18 21:39:25,678 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 21:39:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:25,705 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:25,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442731876] [2021-12-18 21:39:25,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442731876] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:25,705 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:25,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-12-18 21:39:25,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368542564] [2021-12-18 21:39:25,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:25,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-18 21:39:25,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:25,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-18 21:39:25,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=332, Unknown=16, NotChecked=414, Total=870 [2021-12-18 21:39:25,706 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:26,120 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2021-12-18 21:39:26,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:39:26,121 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 21:39:26,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:26,122 INFO L225 Difference]: With dead ends: 152 [2021-12-18 21:39:26,122 INFO L226 Difference]: Without dead ends: 152 [2021-12-18 21:39:26,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=367, Unknown=16, NotChecked=432, Total=930 [2021-12-18 21:39:26,122 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 19 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 732 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:26,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 558 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 732 Unchecked, 0.3s Time] [2021-12-18 21:39:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2021-12-18 21:39:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2021-12-18 21:39:26,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 151 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:26,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2021-12-18 21:39:26,125 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 27 [2021-12-18 21:39:26,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:26,125 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2021-12-18 21:39:26,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:26,125 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2021-12-18 21:39:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 21:39:26,126 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:26,126 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1] [2021-12-18 21:39:26,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2021-12-18 21:39:26,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:26,335 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:26,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:26,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2127966700, now seen corresponding path program 1 times [2021-12-18 21:39:26,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:26,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093560316] [2021-12-18 21:39:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:26,336 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:26,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:26,337 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:26,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-18 21:39:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:26,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-18 21:39:26,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:26,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:26,510 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:26,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:26,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:26,699 INFO L354 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2021-12-18 21:39:26,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 23 [2021-12-18 21:39:26,705 INFO L354 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2021-12-18 21:39:26,705 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 12 [2021-12-18 21:39:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:26,753 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:26,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093560316] [2021-12-18 21:39:26,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093560316] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:26,754 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:26,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-12-18 21:39:26,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790164025] [2021-12-18 21:39:26,754 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:26,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 21:39:26,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:26,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 21:39:26,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-12-18 21:39:26,755 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:27,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:27,446 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2021-12-18 21:39:27,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-18 21:39:27,447 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 21:39:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:27,447 INFO L225 Difference]: With dead ends: 197 [2021-12-18 21:39:27,448 INFO L226 Difference]: Without dead ends: 197 [2021-12-18 21:39:27,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2021-12-18 21:39:27,448 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 139 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:27,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 398 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-18 21:39:27,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-12-18 21:39:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 164. [2021-12-18 21:39:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 142 states have (on average 1.2535211267605635) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2021-12-18 21:39:27,451 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 28 [2021-12-18 21:39:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:27,451 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2021-12-18 21:39:27,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2021-12-18 21:39:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-18 21:39:27,452 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:27,452 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:27,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:27,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:27,659 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:27,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1139690903, now seen corresponding path program 2 times [2021-12-18 21:39:27,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:27,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840921828] [2021-12-18 21:39:27,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:39:27,660 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:27,661 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:27,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-18 21:39:27,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:39:27,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:39:27,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 21:39:27,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:27,794 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:27,810 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 21:39:27,858 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:27,859 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:39:27,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:39:27,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-12-18 21:39:27,896 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:27,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 8 [2021-12-18 21:39:27,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:28,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:28,034 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:28,035 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2021-12-18 21:39:28,060 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:28,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:28,103 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2021-12-18 21:39:28,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:28,175 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2021-12-18 21:39:28,225 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:28,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:28,308 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:28,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:28,331 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:28,343 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_592) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK)) is different from false [2021-12-18 21:39:28,416 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_592 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_18|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_592) |v_ULTIMATE.start_main_#t~malloc3#1.base_18| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:39:28,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_592 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_18|))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_592) |v_ULTIMATE.start_main_#t~malloc3#1.base_18| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:39:28,486 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_592 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_18|))) (= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_592) |v_ULTIMATE.start_main_#t~malloc3#1.base_18| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:39:28,518 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:39:28,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 14 [2021-12-18 21:39:28,534 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_592 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_18| (_ BitVec 32)) (v_ArrVal_586 (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_18| |c_ULTIMATE.start_main_~end~0#1.base|) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_586)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_592) |v_ULTIMATE.start_main_#t~malloc3#1.base_18| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK))) is different from false [2021-12-18 21:39:28,681 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_596 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_20| (_ BitVec 32)) (v_ArrVal_592 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_18| (_ BitVec 32)) (v_ArrVal_586 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_20|))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset| v_ArrVal_586)) |v_ULTIMATE.start_main_#t~malloc3#1.base_20| v_ArrVal_592) |v_ULTIMATE.start_main_#t~malloc3#1.base_18| v_ArrVal_596) |c_ULTIMATE.start_main_~list~0#1.base|) (bvadd |c_ULTIMATE.start_main_~list~0#1.offset| (_ bv4 32))) ~unnamed1~0~BLACK) (= |v_ULTIMATE.start_main_#t~malloc3#1.base_18| |c_ULTIMATE.start_main_~list~0#1.base|))) is different from false [2021-12-18 21:39:28,703 INFO L354 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2021-12-18 21:39:28,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2021-12-18 21:39:28,707 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:39:28,708 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2021-12-18 21:39:28,711 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2021-12-18 21:39:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2021-12-18 21:39:28,737 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840921828] [2021-12-18 21:39:28,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840921828] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:28,737 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:28,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2021-12-18 21:39:28,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344227398] [2021-12-18 21:39:28,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:28,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2021-12-18 21:39:28,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:28,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-12-18 21:39:28,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=327, Unknown=20, NotChecked=414, Total=870 [2021-12-18 21:39:28,738 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:29,886 INFO L93 Difference]: Finished difference Result 335 states and 365 transitions. [2021-12-18 21:39:29,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-18 21:39:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-12-18 21:39:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:29,887 INFO L225 Difference]: With dead ends: 335 [2021-12-18 21:39:29,888 INFO L226 Difference]: Without dead ends: 335 [2021-12-18 21:39:29,888 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 9 SemanticMatches, 39 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=771, Unknown=22, NotChecked=612, Total=1640 [2021-12-18 21:39:29,888 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 312 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 2244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1525 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:29,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 541 Invalid, 2244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 654 Invalid, 0 Unknown, 1525 Unchecked, 0.7s Time] [2021-12-18 21:39:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-12-18 21:39:29,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 171. [2021-12-18 21:39:29,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 149 states have (on average 1.2483221476510067) internal successors, (186), 170 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 186 transitions. [2021-12-18 21:39:29,891 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 186 transitions. Word has length 28 [2021-12-18 21:39:29,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:29,892 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 186 transitions. [2021-12-18 21:39:29,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 30 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:29,892 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 186 transitions. [2021-12-18 21:39:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-18 21:39:29,892 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:29,892 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-18 21:39:29,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:30,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:30,095 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1542458694, now seen corresponding path program 1 times [2021-12-18 21:39:30,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:30,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812102855] [2021-12-18 21:39:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:30,096 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:30,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:30,097 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:30,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-18 21:39:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:30,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 21:39:30,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:39:30,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-18 21:39:32,451 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:32,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812102855] [2021-12-18 21:39:32,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812102855] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:32,451 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:32,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2021-12-18 21:39:32,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300233569] [2021-12-18 21:39:32,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:32,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 21:39:32,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:32,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 21:39:32,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2021-12-18 21:39:32,453 INFO L87 Difference]: Start difference. First operand 171 states and 186 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:32,458 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2021-12-18 21:39:32,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 21:39:32,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-12-18 21:39:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:32,459 INFO L225 Difference]: With dead ends: 179 [2021-12-18 21:39:32,459 INFO L226 Difference]: Without dead ends: 156 [2021-12-18 21:39:32,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=12, Invalid=17, Unknown=1, NotChecked=0, Total=30 [2021-12-18 21:39:32,460 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:32,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 67 Unchecked, 0.0s Time] [2021-12-18 21:39:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2021-12-18 21:39:32,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2021-12-18 21:39:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 134 states have (on average 1.2686567164179106) internal successors, (170), 155 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:32,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 170 transitions. [2021-12-18 21:39:32,462 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 170 transitions. Word has length 29 [2021-12-18 21:39:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:32,462 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 170 transitions. [2021-12-18 21:39:32,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:32,463 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 170 transitions. [2021-12-18 21:39:32,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 21:39:32,464 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:32,464 INFO L514 BasicCegarLoop]: 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, 1, 1] [2021-12-18 21:39:32,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:32,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:32,671 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:32,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash -920225901, now seen corresponding path program 1 times [2021-12-18 21:39:32,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1870733303] [2021-12-18 21:39:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 21:39:32,672 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:32,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:32,673 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:32,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-18 21:39:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 21:39:32,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 21:39:32,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:32,788 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:32,827 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:32,827 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:39:32,857 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:32,861 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:32,970 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 21:39:32,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 21 treesize of output 25 [2021-12-18 21:39:32,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2021-12-18 21:39:32,995 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:39:32,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 22 treesize of output 22 [2021-12-18 21:39:33,041 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 21:39:33,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 54 treesize of output 51 [2021-12-18 21:39:33,044 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 43 treesize of output 43 [2021-12-18 21:39:33,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2021-12-18 21:39:33,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 33 treesize of output 21 [2021-12-18 21:39:33,198 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2021-12-18 21:39:33,246 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 21:39:33,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:33,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:33,409 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 82 treesize of output 62 [2021-12-18 21:39:33,422 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_657 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_657) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.base|)) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base| v_ArrVal_655) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_~end~0#1.offset|))) is different from false [2021-12-18 21:39:33,452 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_655) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.offset|)) (forall ((v_ArrVal_657 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_657) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|))) is different from false [2021-12-18 21:39:33,461 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_657 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_657) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) .cse0))) (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|) v_ArrVal_655) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset|)))) is different from false [2021-12-18 21:39:33,474 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:33,474 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2021-12-18 21:39:33,481 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:33,481 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 33 [2021-12-18 21:39:33,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2021-12-18 21:39:33,505 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 21:39:33,505 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2021-12-18 21:39:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:33,612 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:39:33,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1870733303] [2021-12-18 21:39:33,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1870733303] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 21:39:33,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 21:39:33,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-12-18 21:39:33,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672107491] [2021-12-18 21:39:33,613 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 21:39:33,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-18 21:39:33,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 21:39:33,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-18 21:39:33,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=373, Unknown=3, NotChecked=120, Total=552 [2021-12-18 21:39:33,613 INFO L87 Difference]: Start difference. First operand 156 states and 170 transitions. Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:34,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 21:39:34,984 INFO L93 Difference]: Finished difference Result 205 states and 222 transitions. [2021-12-18 21:39:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-18 21:39:34,990 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 21:39:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 21:39:34,991 INFO L225 Difference]: With dead ends: 205 [2021-12-18 21:39:34,991 INFO L226 Difference]: Without dead ends: 205 [2021-12-18 21:39:34,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=785, Unknown=4, NotChecked=180, Total=1122 [2021-12-18 21:39:34,992 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 180 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 1378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 471 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-18 21:39:34,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 735 Invalid, 1378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 882 Invalid, 0 Unknown, 471 Unchecked, 0.9s Time] [2021-12-18 21:39:34,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2021-12-18 21:39:34,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 155. [2021-12-18 21:39:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 133 states have (on average 1.263157894736842) internal successors, (168), 154 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:34,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 168 transitions. [2021-12-18 21:39:34,994 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 168 transitions. Word has length 32 [2021-12-18 21:39:34,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 21:39:34,995 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 168 transitions. [2021-12-18 21:39:34,995 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 21:39:34,995 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 168 transitions. [2021-12-18 21:39:34,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 21:39:34,995 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 21:39:34,996 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:39:35,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-18 21:39:35,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 21:39:35,203 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-12-18 21:39:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 21:39:35,204 INFO L85 PathProgramCache]: Analyzing trace with hash -878207648, now seen corresponding path program 2 times [2021-12-18 21:39:35,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 21:39:35,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576633553] [2021-12-18 21:39:35,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:39:35,204 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 21:39:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 21:39:35,205 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 21:39:35,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-18 21:39:35,310 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:39:35,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:39:35,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 34 conjunts are in the unsatisfiable core [2021-12-18 21:39:35,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:39:35,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:39:35,355 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:39:35,355 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:39:35,373 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:39:35,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2021-12-18 21:39:35,455 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 21:39:35,455 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-18 21:39:35,463 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2021-12-18 21:39:35,527 INFO L354 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2021-12-18 21:39:35,527 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2021-12-18 21:39:35,539 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-18 21:39:35,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2021-12-18 21:39:35,798 INFO L354 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2021-12-18 21:39:35,798 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 36 [2021-12-18 21:39:35,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2021-12-18 21:39:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:39:35,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:39:55,041 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1250 treesize of output 1242 [2021-12-18 21:39:55,289 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:55,290 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26570 treesize of output 24954 [2021-12-18 21:39:55,781 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:39:55,782 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 21 case distinctions, treesize of input 162250 treesize of output 117264 [2021-12-18 21:40:04,402 WARN L227 SmtUtils]: Spent 8.62s on a formula simplification. DAG size of input: 701 DAG size of output: 691 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 21:40:04,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 21:40:04,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576633553] [2021-12-18 21:40:04,937 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 21:40:04,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1064045025] [2021-12-18 21:40:04,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:40:04,937 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 21:40:04,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 21:40:04,939 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 21:40:04,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2021-12-18 21:40:05,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:40:05,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:40:05,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 43 conjunts are in the unsatisfiable core [2021-12-18 21:40:05,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:40:05,124 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:40:05,251 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:40:05,264 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:40:05,264 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:40:05,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:40:05,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:40:05,555 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 21:40:05,555 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 21 [2021-12-18 21:40:05,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 21:40:05,571 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 21:40:05,571 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 36 treesize of output 27 [2021-12-18 21:40:05,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 21:40:05,667 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 21:40:05,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 75 [2021-12-18 21:40:05,679 INFO L354 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2021-12-18 21:40:05,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2021-12-18 21:40:06,311 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-12-18 21:40:06,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 51 [2021-12-18 21:40:06,322 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:40:06,323 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 28 [2021-12-18 21:40:06,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:40:06,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:40:28,669 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:40:28,670 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 33057 treesize of output 30357 [2021-12-18 21:40:35,639 WARN L227 SmtUtils]: Spent 6.02s on a formula simplification. DAG size of input: 416 DAG size of output: 267 (called from [L 351] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2021-12-18 21:40:35,640 INFO L354 Elim1Store]: treesize reduction 591, result has 51.0 percent of original size [2021-12-18 21:40:35,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 15 new quantified variables, introduced 92 case distinctions, treesize of input 269888 treesize of output 258506 [2021-12-18 21:40:50,427 WARN L227 SmtUtils]: Spent 14.78s on a formula simplification. DAG size of input: 1744 DAG size of output: 1727 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 21:41:00,302 WARN L227 SmtUtils]: Spent 9.86s on a formula simplification. DAG size of input: 1660 DAG size of output: 1619 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 21:41:00,477 INFO L244 Elim1Store]: Index analysis took 111 ms [2021-12-18 21:41:01,068 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:41:01,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 187143 treesize of output 187107 [2021-12-18 21:41:02,244 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 21:41:02,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758049353] [2021-12-18 21:41:02,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 21:41:02,245 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 21:41:02,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 21:41:02,246 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 21:41:02,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-18 21:41:02,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 21:41:02,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 21:41:02,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-18 21:41:02,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 21:41:02,378 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:41:02,428 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 21:41:02,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 21:41:02,569 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-18 21:41:02,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-12-18 21:41:02,970 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-12-18 21:41:02,970 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 26 treesize of output 21 [2021-12-18 21:41:02,994 INFO L354 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2021-12-18 21:41:02,994 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 27 treesize of output 22 [2021-12-18 21:41:03,142 INFO L354 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2021-12-18 21:41:03,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 50 [2021-12-18 21:41:03,148 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2021-12-18 21:41:04,163 INFO L354 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2021-12-18 21:41:04,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2021-12-18 21:41:04,174 INFO L354 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2021-12-18 21:41:04,174 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2021-12-18 21:41:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 21:41:04,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 21:41:08,847 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 21:41:08,848 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 13463 treesize of output 12251 [2021-12-18 21:41:09,192 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14695 treesize of output 14575 [2021-12-18 21:41:09,439 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 21:41:09,439 INFO L186 FreeRefinementEngine]: Found 0 perfect and 0 imperfect interpolant sequences. [2021-12-18 21:41:09,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-12-18 21:41:09,439 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-12-18 21:41:09,439 INFO L628 BasicCegarLoop]: Counterexample might be feasible [2021-12-18 21:41:09,443 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (53 of 54 remaining) [2021-12-18 21:41:09,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (52 of 54 remaining) [2021-12-18 21:41:09,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (51 of 54 remaining) [2021-12-18 21:41:09,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (50 of 54 remaining) [2021-12-18 21:41:09,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (49 of 54 remaining) [2021-12-18 21:41:09,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (48 of 54 remaining) [2021-12-18 21:41:09,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (47 of 54 remaining) [2021-12-18 21:41:09,445 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (46 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (45 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (44 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (43 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (42 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (41 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (40 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (39 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (38 of 54 remaining) [2021-12-18 21:41:09,446 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (37 of 54 remaining) [2021-12-18 21:41:09,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (36 of 54 remaining) [2021-12-18 21:41:09,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (35 of 54 remaining) [2021-12-18 21:41:09,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (34 of 54 remaining) [2021-12-18 21:41:09,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (33 of 54 remaining) [2021-12-18 21:41:09,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (32 of 54 remaining) [2021-12-18 21:41:09,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (31 of 54 remaining) [2021-12-18 21:41:09,447 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK (30 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (29 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (28 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (27 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (26 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (25 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (24 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (23 of 54 remaining) [2021-12-18 21:41:09,448 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (22 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (21 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK (20 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (19 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (18 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (17 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (16 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (15 of 54 remaining) [2021-12-18 21:41:09,449 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (14 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (13 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (12 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (11 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (10 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (9 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE (8 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE (7 of 54 remaining) [2021-12-18 21:41:09,450 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE (6 of 54 remaining) [2021-12-18 21:41:09,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (5 of 54 remaining) [2021-12-18 21:41:09,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (4 of 54 remaining) [2021-12-18 21:41:09,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE (3 of 54 remaining) [2021-12-18 21:41:09,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (2 of 54 remaining) [2021-12-18 21:41:09,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (1 of 54 remaining) [2021-12-18 21:41:09,451 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (0 of 54 remaining) [2021-12-18 21:41:09,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2021-12-18 21:41:09,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2021-12-18 21:41:09,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2021-12-18 21:41:10,067 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-18 21:41:10,070 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 21:41:10,072 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-18 21:41:10,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:41:10 BoogieIcfgContainer [2021-12-18 21:41:10,080 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-18 21:41:10,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-18 21:41:10,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-18 21:41:10,080 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-18 21:41:10,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:38:58" (3/4) ... [2021-12-18 21:41:10,082 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-18 21:41:10,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-18 21:41:10,083 INFO L158 Benchmark]: Toolchain (without parser) took 132717.02ms. Allocated memory was 56.6MB in the beginning and 373.3MB in the end (delta: 316.7MB). Free memory was 34.0MB in the beginning and 191.1MB in the end (delta: -157.1MB). Peak memory consumption was 160.0MB. Max. memory is 16.1GB. [2021-12-18 21:41:10,083 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:10,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.94ms. Allocated memory is still 56.6MB. Free memory was 33.8MB in the beginning and 32.0MB in the end (delta: 1.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-18 21:41:10,083 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.67ms. Allocated memory is still 56.6MB. Free memory was 31.8MB in the beginning and 29.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:41:10,083 INFO L158 Benchmark]: Boogie Preprocessor took 47.21ms. Allocated memory is still 56.6MB. Free memory was 29.8MB in the beginning and 27.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-18 21:41:10,084 INFO L158 Benchmark]: RCFGBuilder took 476.48ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.9MB in the beginning and 36.3MB in the end (delta: -8.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2021-12-18 21:41:10,084 INFO L158 Benchmark]: TraceAbstraction took 131740.12ms. Allocated memory was 69.2MB in the beginning and 373.3MB in the end (delta: 304.1MB). Free memory was 35.7MB in the beginning and 191.1MB in the end (delta: -155.5MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. [2021-12-18 21:41:10,084 INFO L158 Benchmark]: Witness Printer took 2.09ms. Allocated memory is still 373.3MB. Free memory is still 191.1MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 21:41:10,085 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.11ms. Allocated memory is still 56.6MB. Free memory is still 38.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.94ms. Allocated memory is still 56.6MB. Free memory was 33.8MB in the beginning and 32.0MB in the end (delta: 1.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.67ms. Allocated memory is still 56.6MB. Free memory was 31.8MB in the beginning and 29.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.21ms. Allocated memory is still 56.6MB. Free memory was 29.8MB in the beginning and 27.9MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 476.48ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.9MB in the beginning and 36.3MB in the end (delta: -8.4MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * TraceAbstraction took 131740.12ms. Allocated memory was 69.2MB in the beginning and 373.3MB in the end (delta: 304.1MB). Free memory was 35.7MB in the beginning and 191.1MB in the end (delta: -155.5MB). Peak memory consumption was 213.6MB. Max. memory is 16.1GB. * Witness Printer took 2.09ms. Allocated memory is still 373.3MB. Free memory is still 191.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1006] SLL* list = malloc(sizeof(SLL)); [L1007] list->next = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; [L1013] COND TRUE __VERIFIER_nondet_int() [L1016] end->next = malloc(sizeof(SLL)) [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = ((void*)0) [L1020] COND TRUE __VERIFIER_nondet_int() [L1022] end->colour = BLACK [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = ((void*)0) [L1035] end = list [L1038] COND FALSE !(!(((void*)0) != end)) [L1039] EXPR end->colour [L1039] COND FALSE !(!(BLACK == end->colour)) [L1041] COND TRUE ((void*)0) != end [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1050] EXPR end->next [L1050] end = end->next [L1041] COND TRUE ((void*)0) != end [L1043] EXPR end->colour [L1043] COND FALSE !(RED == end->colour) [L1050] EXPR end->next [L1050] end = end->next [L1041] COND TRUE ((void*)0) != end [L1043] end->colour - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1027]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1039]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1046]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1047]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1050]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1056]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1060]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1065]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1066]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 131.7s, OverallIterations: 24, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2172 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2172 mSDsluCounter, 6631 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4656 IncrementalHoareTripleChecker+Unchecked, 5061 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6011 IncrementalHoareTripleChecker+Invalid, 11010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 1570 mSDtfsCounter, 6011 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 755 GetRequests, 436 SyntacticMatches, 47 SemanticMatches, 272 ConstructedPredicates, 33 IntricatePredicates, 1 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 17.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=21, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 616 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 49.0s InterpolantComputationTime, 466 NumberOfCodeBlocks, 466 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 670 ConstructedInterpolants, 126 QuantifiedInterpolants, 9545 SizeOfPredicates, 158 NumberOfNonLiveVariables, 2476 ConjunctsInSsa, 330 ConjunctsInUnsatCore, 33 InterpolantComputations, 14 PerfectInterpolantSequences, 11/71 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-18 21:41:10,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN