./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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/list-simple/sll2c_append_equal.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 b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:26:43,152 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:26:43,153 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:26:43,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:26:43,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:26:43,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:26:43,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:26:43,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:26:43,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:26:43,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:26:43,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:26:43,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:26:43,198 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:26:43,200 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:26:43,201 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:26:43,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:26:43,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:26:43,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:26:43,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:26:43,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:26:43,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:26:43,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:26:43,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:26:43,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:26:43,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:26:43,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:26:43,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:26:43,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:26:43,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:26:43,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:26:43,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:26:43,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:26:43,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:26:43,226 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:26:43,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:26:43,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:26:43,227 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:26:43,227 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:26:43,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:26:43,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:26:43,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:26:43,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:26:43,254 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:26:43,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:26:43,255 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:26:43,255 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:26:43,255 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:26:43,256 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:26:43,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:26:43,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:26:43,256 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:26:43,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:26:43,257 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:26:43,257 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:26:43,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:26:43,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:26:43,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:26:43,258 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:26:43,258 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:26:43,258 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:26:43,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:26:43,258 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:26:43,259 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:26:43,259 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:26:43,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:26:43,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:26:43,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:26:43,259 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:26:43,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:26:43,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:26:43,260 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:26:43,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:26:43,260 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:26:43,260 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:26:43,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:26:43,261 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:26:43,261 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> b335af75f55d322161e6a270bf4669ab290ae0e9da4bc480724c7d5e3b79fdab [2023-02-15 13:26:43,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:26:43,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:26:43,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:26:43,464 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:26:43,464 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:26:43,465 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-02-15 13:26:44,472 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:26:44,637 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:26:44,637 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-02-15 13:26:44,644 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c444afbc/cf18bbb610ad4316aeeeb1a7d5276f51/FLAG36a18f768 [2023-02-15 13:26:44,657 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c444afbc/cf18bbb610ad4316aeeeb1a7d5276f51 [2023-02-15 13:26:44,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:26:44,660 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:26:44,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:26:44,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:26:44,663 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:26:44,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:44,664 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c72316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44, skipping insertion in model container [2023-02-15 13:26:44,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:44,669 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:26:44,687 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:26:44,895 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-02-15 13:26:44,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:26:44,910 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:26:44,944 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i[24433,24446] [2023-02-15 13:26:44,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:26:44,966 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:26:44,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44 WrapperNode [2023-02-15 13:26:44,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:26:44,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:26:44,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:26:44,968 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:26:44,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:44,992 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,008 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2023-02-15 13:26:45,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:26:45,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:26:45,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:26:45,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:26:45,016 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,019 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,019 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,028 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:26:45,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:26:45,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:26:45,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:26:45,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (1/1) ... [2023-02-15 13:26:45,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:26:45,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:45,070 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:26:45,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:26:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:26:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:26:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 13:26:45,101 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 13:26:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:26:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:26:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:26:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:26:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:26:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:26:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:26:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:26:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:26:45,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:26:45,246 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:26:45,248 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:26:45,517 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:26:45,522 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:26:45,522 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 13:26:45,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:26:45 BoogieIcfgContainer [2023-02-15 13:26:45,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:26:45,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:26:45,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:26:45,527 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:26:45,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:26:44" (1/3) ... [2023-02-15 13:26:45,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42648d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:26:45, skipping insertion in model container [2023-02-15 13:26:45,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:26:44" (2/3) ... [2023-02-15 13:26:45,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42648d04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:26:45, skipping insertion in model container [2023-02-15 13:26:45,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:26:45" (3/3) ... [2023-02-15 13:26:45,529 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-02-15 13:26:45,540 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:26:45,541 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-02-15 13:26:45,594 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:26:45,600 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24a11c64, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:26:45,600 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-02-15 13:26:45,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:26:45,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:45,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:26:45,609 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:45,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:45,625 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2023-02-15 13:26:45,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:45,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068852534] [2023-02-15 13:26:45,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:45,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:26:45,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:45,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068852534] [2023-02-15 13:26:45,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068852534] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:45,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:45,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:26:45,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075938256] [2023-02-15 13:26:45,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:45,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:26:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:45,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:26:45,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:26:45,837 INFO L87 Difference]: Start difference. First operand has 116 states, 61 states have (on average 2.0327868852459017) internal successors, (124), 111 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:26:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:45,958 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2023-02-15 13:26:45,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:26:45,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:26:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:45,966 INFO L225 Difference]: With dead ends: 114 [2023-02-15 13:26:45,966 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 13:26:45,968 INFO L412 NwaCegarLoop]: 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 [2023-02-15 13:26:45,973 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:45,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:26:45,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 13:26:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-15 13:26:46,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 59 states have (on average 1.9152542372881356) internal successors, (113), 106 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-15 13:26:46,014 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2023-02-15 13:26:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:46,015 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-15 13:26:46,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:26:46,016 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-15 13:26:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:26:46,016 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:46,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:26:46,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:26:46,017 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:46,018 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2023-02-15 13:26:46,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:46,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117997933] [2023-02-15 13:26:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:46,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:26:46,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:46,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117997933] [2023-02-15 13:26:46,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117997933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:46,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:46,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:26:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202066221] [2023-02-15 13:26:46,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:46,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:26:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:26:46,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:26:46,162 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:26:46,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:46,215 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2023-02-15 13:26:46,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:26:46,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:26:46,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:46,216 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:26:46,217 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:26:46,217 INFO L412 NwaCegarLoop]: 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 [2023-02-15 13:26:46,218 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:46,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 181 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:26:46,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:26:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-15 13:26:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 59 states have (on average 1.88135593220339) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2023-02-15 13:26:46,227 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2023-02-15 13:26:46,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:46,228 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2023-02-15 13:26:46,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:26:46,231 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2023-02-15 13:26:46,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:26:46,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:46,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:46,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:26:46,233 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:46,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:46,234 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2023-02-15 13:26:46,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:46,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086281529] [2023-02-15 13:26:46,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:46,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:26:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:46,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086281529] [2023-02-15 13:26:46,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086281529] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:46,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:46,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:26:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392253669] [2023-02-15 13:26:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:46,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:26:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:26:46,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:26:46,315 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:26:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:46,386 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-02-15 13:26:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:26:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 13:26:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:46,390 INFO L225 Difference]: With dead ends: 116 [2023-02-15 13:26:46,390 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 13:26:46,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:26:46,394 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 5 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:46,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 269 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:26:46,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 13:26:46,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-02-15 13:26:46,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 105 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2023-02-15 13:26:46,413 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2023-02-15 13:26:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:46,413 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2023-02-15 13:26:46,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:26:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2023-02-15 13:26:46,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:26:46,414 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:46,415 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:46,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:26:46,415 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2023-02-15 13:26:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:46,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884822100] [2023-02-15 13:26:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:26:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:46,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884822100] [2023-02-15 13:26:46,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884822100] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:46,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:46,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:26:46,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384157366] [2023-02-15 13:26:46,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:46,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:26:46,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:46,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:26:46,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:26:46,555 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:26:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:46,734 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2023-02-15 13:26:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:46,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 13:26:46,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:46,737 INFO L225 Difference]: With dead ends: 110 [2023-02-15 13:26:46,737 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 13:26:46,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:26:46,743 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:46,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 380 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:26:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 13:26:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2023-02-15 13:26:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 60 states have (on average 1.85) internal successors, (111), 104 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2023-02-15 13:26:46,757 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2023-02-15 13:26:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:46,758 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2023-02-15 13:26:46,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:26:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2023-02-15 13:26:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:26:46,759 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:46,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:46,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:26:46,760 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:46,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:46,761 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2023-02-15 13:26:46,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:46,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419059603] [2023-02-15 13:26:46,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:46,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:26:47,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:47,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419059603] [2023-02-15 13:26:47,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419059603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:47,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:47,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:26:47,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320261073] [2023-02-15 13:26:47,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:47,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:26:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:47,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:26:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:26:47,018 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:26:47,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:47,193 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2023-02-15 13:26:47,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-15 13:26:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:47,194 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:26:47,198 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:26:47,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:26:47,199 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 11 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:47,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 404 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:26:47,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:26:47,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2023-02-15 13:26:47,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 103 states have internal predecessors, (110), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-15 13:26:47,202 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2023-02-15 13:26:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:47,202 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-15 13:26:47,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:26:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-15 13:26:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:26:47,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:47,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:47,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:26:47,204 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:47,204 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2023-02-15 13:26:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:47,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50661226] [2023-02-15 13:26:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:47,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:26:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50661226] [2023-02-15 13:26:47,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50661226] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:47,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494550622] [2023-02-15 13:26:47,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:47,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:47,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:47,380 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:26:47,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:26:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:47,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 13:26:47,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:47,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:26:47,518 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-15 13:26:47,528 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-15 13:26:47,541 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:26:47,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 13:26:47,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-15 13:26:47,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:26:47,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494550622] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:26:47,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:26:47,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-15 13:26:47,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229963394] [2023-02-15 13:26:47,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:47,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:26:47,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:47,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:26:47,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-15 13:26:47,751 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:26:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:47,952 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2023-02-15 13:26:47,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:47,952 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-15 13:26:47,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:47,953 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:26:47,953 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:26:47,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-15 13:26:47,954 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 94 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:47,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 406 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 394 Invalid, 0 Unknown, 260 Unchecked, 0.2s Time] [2023-02-15 13:26:47,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:26:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-02-15 13:26:47,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 60 states have (on average 1.8166666666666667) internal successors, (109), 102 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2023-02-15 13:26:47,956 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 25 [2023-02-15 13:26:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:47,957 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2023-02-15 13:26:47,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:26:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2023-02-15 13:26:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:26:47,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:47,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:47,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:26:48,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 13:26:48,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:48,169 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2023-02-15 13:26:48,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:48,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392120261] [2023-02-15 13:26:48,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:48,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:48,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:48,567 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:26:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392120261] [2023-02-15 13:26:48,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392120261] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931084631] [2023-02-15 13:26:48,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:48,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:48,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:48,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:26:48,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:26:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:48,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:26:48,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:48,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:26:48,849 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:26:48,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:26:48,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 13:26:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:26:48,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:49,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931084631] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:49,006 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:49,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-15 13:26:49,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694292480] [2023-02-15 13:26:49,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:49,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 13:26:49,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:49,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 13:26:49,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:26:49,008 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:26:49,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:49,351 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-02-15 13:26:49,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:26:49,351 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-15 13:26:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:49,352 INFO L225 Difference]: With dead ends: 108 [2023-02-15 13:26:49,352 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 13:26:49,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-15 13:26:49,353 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:49,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 453 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:26:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 13:26:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-02-15 13:26:49,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.8) internal successors, (108), 101 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2023-02-15 13:26:49,355 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 25 [2023-02-15 13:26:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:49,355 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2023-02-15 13:26:49,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:26:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2023-02-15 13:26:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:26:49,356 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:49,356 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:49,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 13:26:49,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-15 13:26:49,562 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:49,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:49,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2023-02-15 13:26:49,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:49,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381975327] [2023-02-15 13:26:49,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:49,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:49,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 13:26:49,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:49,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381975327] [2023-02-15 13:26:49,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381975327] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:49,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1721389873] [2023-02-15 13:26:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:49,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:49,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:49,835 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:26:49,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:26:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:49,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 13:26:49,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:49,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:26:49,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:26:49,979 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:26:50,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:50,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:26:50,010 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_522))) is different from true [2023-02-15 13:26:50,016 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_522))) is different from true [2023-02-15 13:26:50,026 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:26:50,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 13:26:50,064 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 13:26:50,077 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:26:50,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:26:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-15 13:26:50,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:50,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1721389873] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:50,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:50,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2023-02-15 13:26:50,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777368175] [2023-02-15 13:26:50,314 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:50,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 13:26:50,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:50,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 13:26:50,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=272, Unknown=4, NotChecked=148, Total=506 [2023-02-15 13:26:50,315 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:50,529 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-02-15 13:26:50,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:50,530 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-15 13:26:50,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:50,530 INFO L225 Difference]: With dead ends: 116 [2023-02-15 13:26:50,530 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 13:26:50,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=363, Unknown=4, NotChecked=172, Total=650 [2023-02-15 13:26:50,531 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 324 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:50,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 229 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 277 Invalid, 0 Unknown, 402 Unchecked, 0.2s Time] [2023-02-15 13:26:50,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 13:26:50,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2023-02-15 13:26:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:50,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-02-15 13:26:50,534 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2023-02-15 13:26:50,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:50,534 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-02-15 13:26:50,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.9375) internal successors, (47), 14 states have internal predecessors, (47), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-02-15 13:26:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 13:26:50,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:50,535 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:50,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:26:50,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:50,740 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2023-02-15 13:26:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:50,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865943916] [2023-02-15 13:26:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:51,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:26:51,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:51,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865943916] [2023-02-15 13:26:51,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865943916] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:51,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310405663] [2023-02-15 13:26:51,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:51,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:51,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:51,085 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:26:51,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:26:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:26:51,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:51,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:26:51,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:26:51,243 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_686 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_686) |c_#length|)))) is different from true [2023-02-15 13:26:51,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:51,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:26:51,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:26:51,282 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_687 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_687))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:26:51,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:51,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:26:51,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:26:51,352 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_688 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_688))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:26:51,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:51,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:26:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-15 13:26:51,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:51,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310405663] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:51,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:51,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-02-15 13:26:51,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085618385] [2023-02-15 13:26:51,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:51,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:26:51,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:51,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:26:51,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2023-02-15 13:26:51,453 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:51,656 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-02-15 13:26:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:26:51,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-15 13:26:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:51,657 INFO L225 Difference]: With dead ends: 108 [2023-02-15 13:26:51,657 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 13:26:51,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2023-02-15 13:26:51,657 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 279 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 273 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:51,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 203 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 274 Invalid, 0 Unknown, 273 Unchecked, 0.2s Time] [2023-02-15 13:26:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 13:26:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-15 13:26:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-15 13:26:51,659 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2023-02-15 13:26:51,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:51,659 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-15 13:26:51,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:26:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-15 13:26:51,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:26:51,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:51,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:51,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:26:51,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:51,861 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:51,861 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2023-02-15 13:26:51,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:51,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610382175] [2023-02-15 13:26:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:51,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:51,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:51,954 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 13:26:51,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:51,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610382175] [2023-02-15 13:26:51,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610382175] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:51,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:51,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:26:51,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226366871] [2023-02-15 13:26:51,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:51,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:26:51,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:51,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:26:51,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:26:51,956 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:26:52,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:52,096 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-02-15 13:26:52,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:52,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-15 13:26:52,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:52,098 INFO L225 Difference]: With dead ends: 106 [2023-02-15 13:26:52,098 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 13:26:52,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:26:52,098 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:52,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 266 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:26:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 13:26:52,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2023-02-15 13:26:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-15 13:26:52,101 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 39 [2023-02-15 13:26:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:52,101 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-15 13:26:52,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:26:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-15 13:26:52,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 13:26:52,102 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:52,102 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:52,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:26:52,102 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:52,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2023-02-15 13:26:52,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:52,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259006379] [2023-02-15 13:26:52,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:52,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:52,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:26:52,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:52,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259006379] [2023-02-15 13:26:52,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259006379] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:52,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:52,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:26:52,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796032834] [2023-02-15 13:26:52,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:52,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:26:52,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:52,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:26:52,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:26:52,292 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:26:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:52,403 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-15 13:26:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:26:52,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-02-15 13:26:52,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:52,404 INFO L225 Difference]: With dead ends: 86 [2023-02-15 13:26:52,404 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 13:26:52,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:26:52,404 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 73 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:52,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:26:52,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 13:26:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-15 13:26:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-15 13:26:52,407 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 39 [2023-02-15 13:26:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:52,407 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-15 13:26:52,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:26:52,407 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-15 13:26:52,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:26:52,407 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:52,407 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:52,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:26:52,408 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:52,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:52,408 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2023-02-15 13:26:52,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:52,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479488627] [2023-02-15 13:26:52,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:52,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 13:26:52,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479488627] [2023-02-15 13:26:52,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479488627] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:52,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740206688] [2023-02-15 13:26:52,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:52,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:52,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:52,829 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:26:52,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:26:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:52,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-15 13:26:52,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:53,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 13:26:53,210 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1044 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1044))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 13:26:53,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:53,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:26:53,230 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 13:26:53,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:26:53,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 13:26:53,289 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-15 13:26:53,290 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:26:53,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740206688] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:53,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:26:53,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-15 13:26:53,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478336664] [2023-02-15 13:26:53,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:53,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 13:26:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:53,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 13:26:53,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-15 13:26:53,291 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:53,686 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-02-15 13:26:53,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 13:26:53,687 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-15 13:26:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:53,687 INFO L225 Difference]: With dead ends: 128 [2023-02-15 13:26:53,688 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 13:26:53,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2023-02-15 13:26:53,688 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 79 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:53,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 665 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 580 Invalid, 3 Unknown, 178 Unchecked, 0.3s Time] [2023-02-15 13:26:53,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 13:26:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2023-02-15 13:26:53,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 80 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-02-15 13:26:53,691 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 41 [2023-02-15 13:26:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:53,691 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-02-15 13:26:53,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-02-15 13:26:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:26:53,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:53,692 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:53,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 13:26:53,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-02-15 13:26:53,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:53,906 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2023-02-15 13:26:53,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:53,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472686737] [2023-02-15 13:26:53,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:53,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:53,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:26:54,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:54,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472686737] [2023-02-15 13:26:54,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472686737] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:54,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709946426] [2023-02-15 13:26:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:54,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:54,681 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:26:54,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:26:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:54,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 13:26:54,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:55,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:26:55,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:26:55,327 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1203 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1203))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1199 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1199) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1202 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1202))))) is different from true [2023-02-15 13:26:55,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:55,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 13:26:55,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:55,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:26:55,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:55,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:26:55,371 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:26:55,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:26:55,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 13:26:55,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:26:55,461 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 13:26:55,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:56,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709946426] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:56,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:56,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2023-02-15 13:26:56,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823186327] [2023-02-15 13:26:56,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:56,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 13:26:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:56,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 13:26:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1222, Unknown=2, NotChecked=70, Total=1406 [2023-02-15 13:26:56,280 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:26:57,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:57,876 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2023-02-15 13:26:57,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 13:26:57,876 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2023-02-15 13:26:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:57,877 INFO L225 Difference]: With dead ends: 140 [2023-02-15 13:26:57,877 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 13:26:57,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=331, Invalid=2638, Unknown=5, NotChecked=106, Total=3080 [2023-02-15 13:26:57,878 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 436 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1304 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1304 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:57,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1257 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1304 Invalid, 3 Unknown, 150 Unchecked, 0.7s Time] [2023-02-15 13:26:57,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 13:26:57,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 89. [2023-02-15 13:26:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2023-02-15 13:26:57,881 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2023-02-15 13:26:57,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:57,881 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2023-02-15 13:26:57,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:26:57,881 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2023-02-15 13:26:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:26:57,885 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:57,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:57,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:26:58,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:58,091 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:58,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:58,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2023-02-15 13:26:58,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:58,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083388689] [2023-02-15 13:26:58,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:58,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 13:26:58,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:58,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083388689] [2023-02-15 13:26:58,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083388689] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:58,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:58,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:26:58,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187816806] [2023-02-15 13:26:58,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:58,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:26:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:58,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:26:58,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:26:58,282 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:58,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:58,496 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-02-15 13:26:58,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:26:58,496 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2023-02-15 13:26:58,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:58,497 INFO L225 Difference]: With dead ends: 152 [2023-02-15 13:26:58,497 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 13:26:58,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:26:58,497 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 270 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:58,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 398 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:26:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 13:26:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2023-02-15 13:26:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.391304347826087) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-02-15 13:26:58,499 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2023-02-15 13:26:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:58,500 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-02-15 13:26:58,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-02-15 13:26:58,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 13:26:58,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:58,500 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:26:58,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:26:58,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:58,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2023-02-15 13:26:58,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:58,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903289005] [2023-02-15 13:26:58,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:58,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:58,819 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:26:58,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:58,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903289005] [2023-02-15 13:26:58,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903289005] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:26:58,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:26:58,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:26:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860070386] [2023-02-15 13:26:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:26:58,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:26:58,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:26:58,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:26:58,821 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:59,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:26:59,086 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-15 13:26:59,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:26:59,086 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2023-02-15 13:26:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:26:59,087 INFO L225 Difference]: With dead ends: 134 [2023-02-15 13:26:59,087 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:26:59,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:26:59,089 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 275 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:26:59,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 411 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:26:59,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:26:59,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2023-02-15 13:26:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 71 states have (on average 1.380281690140845) internal successors, (98), 89 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:26:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-02-15 13:26:59,092 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 44 [2023-02-15 13:26:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:26:59,092 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-02-15 13:26:59,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:26:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-02-15 13:26:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:26:59,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:26:59,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 13:26:59,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:26:59,096 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:26:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:26:59,096 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2023-02-15 13:26:59,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:26:59,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193883708] [2023-02-15 13:26:59,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:59,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:26:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:59,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:26:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:26:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:26:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:59,450 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:26:59,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:26:59,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193883708] [2023-02-15 13:26:59,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193883708] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:59,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145935797] [2023-02-15 13:26:59,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:26:59,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:26:59,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:26:59,465 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:26:59,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:26:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:26:59,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 13:26:59,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:26:59,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 13:26:59,842 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1614 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1614)))) is different from true [2023-02-15 13:26:59,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:26:59,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 13:26:59,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 13:26:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 13:26:59,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:26:59,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145935797] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:26:59,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:26:59,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 13:26:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318106828] [2023-02-15 13:26:59,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:26:59,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 13:26:59,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:26:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 13:26:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=4, NotChecked=50, Total=756 [2023-02-15 13:26:59,986 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:27:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:00,391 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-02-15 13:27:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:27:00,392 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-15 13:27:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:00,392 INFO L225 Difference]: With dead ends: 90 [2023-02-15 13:27:00,392 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 13:27:00,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=4, NotChecked=66, Total=1260 [2023-02-15 13:27:00,393 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 381 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:00,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 591 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 418 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2023-02-15 13:27:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 13:27:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2023-02-15 13:27:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 81 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:27:00,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-15 13:27:00,395 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 46 [2023-02-15 13:27:00,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:00,395 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-15 13:27:00,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 22 states have internal predecessors, (59), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:27:00,395 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-15 13:27:00,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:27:00,396 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:00,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 13:27:00,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:00,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:00,603 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:27:00,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:00,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2023-02-15 13:27:00,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:00,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452854968] [2023-02-15 13:27:00,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:00,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:01,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:01,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:01,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:01,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:01,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:01,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452854968] [2023-02-15 13:27:01,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452854968] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:01,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213409304] [2023-02-15 13:27:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:01,598 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:27:01,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:27:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:01,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 93 conjunts are in the unsatisfiable core [2023-02-15 13:27:01,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:01,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:27:01,959 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:27:01,959 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:27:02,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:27:02,147 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:02,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 13:27:02,278 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:02,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-02-15 13:27:02,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:27:02,385 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1782)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1781)))) is different from true [2023-02-15 13:27:02,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:02,417 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:02,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2023-02-15 13:27:02,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:02,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:27:02,446 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-02-15 13:27:02,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-02-15 13:27:02,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:27:02,676 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:02,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-02-15 13:27:02,743 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 13:27:02,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:02,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213409304] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:02,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:02,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2023-02-15 13:27:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031096639] [2023-02-15 13:27:02,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:02,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:27:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:27:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1918, Unknown=1, NotChecked=88, Total=2162 [2023-02-15 13:27:02,846 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:04,320 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2023-02-15 13:27:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 13:27:04,321 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-15 13:27:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:04,322 INFO L225 Difference]: With dead ends: 183 [2023-02-15 13:27:04,322 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 13:27:04,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=383, Invalid=3402, Unknown=1, NotChecked=120, Total=3906 [2023-02-15 13:27:04,323 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 559 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 1819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:04,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1079 Invalid, 1819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1613 Invalid, 0 Unknown, 184 Unchecked, 0.8s Time] [2023-02-15 13:27:04,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 13:27:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2023-02-15 13:27:04,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:27:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-02-15 13:27:04,325 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 46 [2023-02-15 13:27:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:04,326 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-02-15 13:27:04,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-02-15 13:27:04,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:27:04,326 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:04,326 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 13:27:04,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-15 13:27:04,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 13:27:04,532 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:27:04,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:04,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2023-02-15 13:27:04,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:04,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241171849] [2023-02-15 13:27:04,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:04,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:04,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:05,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:05,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:05,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:05,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241171849] [2023-02-15 13:27:05,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241171849] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:05,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198198979] [2023-02-15 13:27:05,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:05,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:05,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:05,910 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:27:05,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:27:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:06,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 114 conjunts are in the unsatisfiable core [2023-02-15 13:27:06,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:06,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:27:06,442 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:27:06,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:27:06,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:27:06,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:27:06,717 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:06,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-15 13:27:06,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:27:06,918 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:06,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2023-02-15 13:27:06,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 13:27:06,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-02-15 13:27:06,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:27:07,053 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1960 (Array Int Int)) (v_ArrVal_1959 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1959)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1960) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:27:07,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:07,099 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:27:07,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2023-02-15 13:27:07,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:07,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:07,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:07,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 13:27:07,121 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:27:07,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 13:27:07,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-02-15 13:27:07,366 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 13:27:07,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2023-02-15 13:27:07,372 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:27:07,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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 [2023-02-15 13:27:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 13:27:07,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:08,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198198979] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:08,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:08,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 51 [2023-02-15 13:27:08,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465818227] [2023-02-15 13:27:08,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:08,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 13:27:08,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:08,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 13:27:08,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=3016, Unknown=1, NotChecked=110, Total=3306 [2023-02-15 13:27:08,721 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:13,013 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2023-02-15 13:27:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 13:27:13,013 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2023-02-15 13:27:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:13,014 INFO L225 Difference]: With dead ends: 215 [2023-02-15 13:27:13,014 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 13:27:13,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=534, Invalid=5475, Unknown=1, NotChecked=152, Total=6162 [2023-02-15 13:27:13,016 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 603 mSDsluCounter, 2279 mSDsCounter, 0 mSdLazyCounter, 3163 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 2355 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 3163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:13,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 2355 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 3163 Invalid, 0 Unknown, 150 Unchecked, 1.7s Time] [2023-02-15 13:27:13,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 13:27:13,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 105. [2023-02-15 13:27:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3375) internal successors, (107), 98 states have internal predecessors, (107), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:27:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-02-15 13:27:13,018 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 46 [2023-02-15 13:27:13,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:13,018 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-02-15 13:27:13,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 45 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:13,018 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-02-15 13:27:13,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:27:13,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:13,019 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 13:27:13,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:13,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 13:27:13,226 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:27:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:13,237 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2023-02-15 13:27:13,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:13,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161249813] [2023-02-15 13:27:13,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:13,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:13,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:13,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:13,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:13,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161249813] [2023-02-15 13:27:13,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161249813] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:13,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260143794] [2023-02-15 13:27:13,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:13,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:13,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:13,983 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:27:13,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:27:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:14,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 13:27:14,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:14,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:27:14,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:14,214 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 13:27:14,228 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:14,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:27:14,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:14,337 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:14,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:27:14,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-02-15 13:27:14,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:14,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 13:27:14,788 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 13:27:14,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 13:27:15,028 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:15,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-15 13:27:15,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:15,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 13:27:15,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 13:27:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-15 13:27:15,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:15,142 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 13:27:19,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260143794] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:19,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:19,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2023-02-15 13:27:19,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97464996] [2023-02-15 13:27:19,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:19,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 13:27:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 13:27:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2289, Unknown=111, NotChecked=198, Total=2756 [2023-02-15 13:27:19,590 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:27:21,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:21,862 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2023-02-15 13:27:21,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 13:27:21,862 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-15 13:27:21,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:21,864 INFO L225 Difference]: With dead ends: 216 [2023-02-15 13:27:21,864 INFO L226 Difference]: Without dead ends: 216 [2023-02-15 13:27:21,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=630, Invalid=4812, Unknown=116, NotChecked=294, Total=5852 [2023-02-15 13:27:21,865 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1821 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 47 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1821 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:21,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1821 Valid, 854 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1404 Invalid, 2 Unknown, 113 Unchecked, 0.7s Time] [2023-02-15 13:27:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-15 13:27:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 106. [2023-02-15 13:27:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.345679012345679) internal successors, (109), 99 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:27:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-02-15 13:27:21,868 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 51 [2023-02-15 13:27:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:21,868 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-02-15 13:27:21,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 1.9772727272727273) internal successors, (87), 40 states have internal predecessors, (87), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:27:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-02-15 13:27:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:27:21,868 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:21,869 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2023-02-15 13:27:21,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:22,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:22,069 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:27:22,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:22,070 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2023-02-15 13:27:22,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:22,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869824873] [2023-02-15 13:27:22,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:22,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:22,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:22,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:23,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869824873] [2023-02-15 13:27:23,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869824873] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:23,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769949941] [2023-02-15 13:27:23,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:23,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:23,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:23,050 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:27:23,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:27:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:23,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 89 conjunts are in the unsatisfiable core [2023-02-15 13:27:23,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:23,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:27:23,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:23,308 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 13:27:23,323 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:23,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:27:23,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:23,424 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:23,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:27:23,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 13:27:23,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:27:23,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:23,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2023-02-15 13:27:23,894 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:27:23,894 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2023-02-15 13:27:23,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-02-15 13:27:23,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:23,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-02-15 13:27:24,173 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:24,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-02-15 13:27:24,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 13:27:24,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:24,238 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2023-02-15 13:27:24,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:24,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-02-15 13:27:24,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2023-02-15 13:27:24,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 13:27:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-15 13:27:24,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:24,476 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2351 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_2352 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2351) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2352) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:27:25,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769949941] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:25,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:25,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 45 [2023-02-15 13:27:25,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432688779] [2023-02-15 13:27:25,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:25,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 13:27:25,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:25,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 13:27:25,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=2530, Unknown=47, NotChecked=206, Total=2970 [2023-02-15 13:27:25,293 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:27:27,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:27,821 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2023-02-15 13:27:27,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:27:27,821 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2023-02-15 13:27:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:27,822 INFO L225 Difference]: With dead ends: 197 [2023-02-15 13:27:27,822 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 13:27:27,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=487, Invalid=4166, Unknown=47, NotChecked=270, Total=4970 [2023-02-15 13:27:27,823 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1440 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:27,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 844 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1557 Invalid, 0 Unknown, 153 Unchecked, 0.9s Time] [2023-02-15 13:27:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 13:27:27,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 119. [2023-02-15 13:27:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 112 states have internal predecessors, (124), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:27:27,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2023-02-15 13:27:27,828 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 51 [2023-02-15 13:27:27,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:27,828 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2023-02-15 13:27:27,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 2.0) internal successors, (86), 39 states have internal predecessors, (86), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:27:27,829 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2023-02-15 13:27:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:27:27,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:27,829 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2023-02-15 13:27:27,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:28,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:28,035 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:27:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:28,036 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2023-02-15 13:27:28,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:28,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012860967] [2023-02-15 13:27:28,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:28,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:28,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:28,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:28,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:29,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:29,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012860967] [2023-02-15 13:27:29,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012860967] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:29,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847814357] [2023-02-15 13:27:29,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:27:29,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:29,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:29,288 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:27:29,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:27:29,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:27:29,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:27:29,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 145 conjunts are in the unsatisfiable core [2023-02-15 13:27:29,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:29,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:27:29,726 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:29,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:27:29,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:27:29,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:27:29,924 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:27:29,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 38 [2023-02-15 13:27:29,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2023-02-15 13:27:30,414 INFO L321 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2023-02-15 13:27:30,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 77 [2023-02-15 13:27:30,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:30,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:30,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:30,428 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:27:30,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 49 [2023-02-15 13:27:30,442 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 13:27:30,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:27:31,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:31,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:31,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:31,438 INFO L321 Elim1Store]: treesize reduction 78, result has 8.2 percent of original size [2023-02-15 13:27:31,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 42 [2023-02-15 13:27:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:27:31,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:34,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847814357] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:34,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:34,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 56 [2023-02-15 13:27:34,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728069571] [2023-02-15 13:27:34,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:34,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-02-15 13:27:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:34,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-02-15 13:27:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3919, Unknown=3, NotChecked=0, Total=4160 [2023-02-15 13:27:34,611 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:37,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:37,679 INFO L93 Difference]: Finished difference Result 121 states and 136 transitions. [2023-02-15 13:27:37,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 13:27:37,679 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 51 [2023-02-15 13:27:37,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:37,680 INFO L225 Difference]: With dead ends: 121 [2023-02-15 13:27:37,680 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 13:27:37,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1929 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=532, Invalid=7121, Unknown=3, NotChecked=0, Total=7656 [2023-02-15 13:27:37,682 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 221 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 1892 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1892 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:37,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1685 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1892 Invalid, 1 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 13:27:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 13:27:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2023-02-15 13:27:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.3085106382978724) internal successors, (123), 112 states have internal predecessors, (123), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:27:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 133 transitions. [2023-02-15 13:27:37,684 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 133 transitions. Word has length 51 [2023-02-15 13:27:37,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:37,684 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 133 transitions. [2023-02-15 13:27:37,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.6538461538461537) internal successors, (86), 49 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 133 transitions. [2023-02-15 13:27:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:27:37,685 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:37,685 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1] [2023-02-15 13:27:37,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:37,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 13:27:37,901 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:27:37,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:37,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1455991656, now seen corresponding path program 1 times [2023-02-15 13:27:37,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:37,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029645114] [2023-02-15 13:27:37,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:37,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:38,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029645114] [2023-02-15 13:27:38,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029645114] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:38,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064023199] [2023-02-15 13:27:38,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:38,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:38,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:38,811 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:27:38,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:27:39,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:39,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 99 conjunts are in the unsatisfiable core [2023-02-15 13:27:39,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:39,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:27:39,193 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:27:39,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:27:39,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:27:39,376 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:27:39,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 13:27:39,490 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:27:39,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2023-02-15 13:27:39,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:39,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:27:39,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:39,703 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:27:39,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 38 [2023-02-15 13:27:39,711 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:27:39,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:27:39,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:39,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 13:27:39,982 INFO L321 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2023-02-15 13:27:39,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 29 [2023-02-15 13:27:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:27:40,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:40,201 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2742 (Array Int Int)) (v_ArrVal_2741 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| Int)) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2742))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| v_ArrVal_2741) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_29| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 13:27:40,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064023199] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:40,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:40,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 47 [2023-02-15 13:27:40,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140058990] [2023-02-15 13:27:40,202 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:40,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 13:27:40,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:40,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 13:27:40,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2482, Unknown=1, NotChecked=100, Total=2756 [2023-02-15 13:27:40,204 INFO L87 Difference]: Start difference. First operand 119 states and 133 transitions. Second operand has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:27:41,830 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2023-02-15 13:27:41,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:27:41,830 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-15 13:27:41,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:27:41,831 INFO L225 Difference]: With dead ends: 120 [2023-02-15 13:27:41,831 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 13:27:41,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1207 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=336, Invalid=4089, Unknown=1, NotChecked=130, Total=4556 [2023-02-15 13:27:41,834 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 137 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1593 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:27:41,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1593 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 13:27:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 13:27:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2023-02-15 13:27:41,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.297872340425532) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:27:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-15 13:27:41,843 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 53 [2023-02-15 13:27:41,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:27:41,844 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-15 13:27:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 43 states have (on average 1.7906976744186047) internal successors, (77), 39 states have internal predecessors, (77), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:27:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-15 13:27:41,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 13:27:41,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:27:41,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1] [2023-02-15 13:27:41,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:27:42,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-15 13:27:42,052 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:27:42,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:27:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2023-02-15 13:27:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:27:42,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631459773] [2023-02-15 13:27:42,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:42,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:27:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:42,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:27:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:42,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:27:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:27:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,341 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:27:43,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:27:43,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631459773] [2023-02-15 13:27:43,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631459773] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:43,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342314926] [2023-02-15 13:27:43,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:27:43,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:27:43,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:27:43,342 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:27:43,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 13:27:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:27:43,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 110 conjunts are in the unsatisfiable core [2023-02-15 13:27:43,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:27:43,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:27:43,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:43,650 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2922 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2922))))) is different from true [2023-02-15 13:27:43,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:43,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:27:43,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:43,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:43,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:27:44,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 13:27:44,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:44,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:44,156 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:27:44,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:27:44,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:44,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:27:44,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:44,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-02-15 13:27:44,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:44,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:44,504 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:27:44,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 21 treesize of output 34 [2023-02-15 13:27:44,519 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:27:44,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:27:45,184 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-02-15 13:27:45,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 57 [2023-02-15 13:27:45,202 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 13:27:45,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2023-02-15 13:27:45,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:45,526 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 13:27:45,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 101 [2023-02-15 13:27:45,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:27:45,541 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 13:27:45,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 110 [2023-02-15 13:27:45,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:45,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:45,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:27:46,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:27:46,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-02-15 13:27:46,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-15 13:27:46,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:27:46,277 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:27:46,290 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset|)))) (and (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2023-02-15 13:27:57,507 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (forall ((v_ArrVal_2944 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_subst_2 Int)) (or (forall ((v_ArrVal_2933 (Array Int Int))) (<= 0 (+ (select (select (store (store .cse1 v_subst_2 (store (select .cse1 v_subst_2) .cse0 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (<= (+ .cse0 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945) v_subst_2))))))))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0)))))) (forall ((v_ArrVal_2945 Int)) (or (not (<= 8 v_ArrVal_2945)) (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2944 (Array Int Int)) (v_ArrVal_2943 (Array Int Int)) (|ULTIMATE.start_sll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2944))) (let ((.cse2 (select (select .cse3 |ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (or (not (<= 0 .cse2)) (forall ((v_subst_1 Int)) (let ((.cse4 (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2945))) (or (forall ((v_ArrVal_2934 (Array Int Int)) (v_ArrVal_2933 (Array Int Int))) (<= (+ 8 (select (select (store (store .cse3 v_subst_1 (store (select .cse3 v_subst_1) .cse2 0)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2933) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select .cse4 (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2943))) (store .cse5 v_subst_1 (store (select .cse5 v_subst_1) .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_2934) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (<= (+ .cse2 4) (select .cse4 v_subst_1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|) 0))))))) is different from false [2023-02-15 13:27:57,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342314926] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:27:57,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:27:57,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 51 [2023-02-15 13:27:57,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337219910] [2023-02-15 13:27:57,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:27:57,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 13:27:57,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:27:57,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 13:27:57,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=3175, Unknown=7, NotChecked=468, Total=3906 [2023-02-15 13:27:57,513 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:02,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:02,250 INFO L93 Difference]: Finished difference Result 181 states and 197 transitions. [2023-02-15 13:28:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 13:28:02,250 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 56 [2023-02-15 13:28:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:02,251 INFO L225 Difference]: With dead ends: 181 [2023-02-15 13:28:02,251 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 13:28:02,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=701, Invalid=6280, Unknown=7, NotChecked=668, Total=7656 [2023-02-15 13:28:02,252 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 644 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 2658 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 2851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:02,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 1841 Invalid, 2851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2658 Invalid, 0 Unknown, 168 Unchecked, 1.9s Time] [2023-02-15 13:28:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 13:28:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 105. [2023-02-15 13:28:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 98 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-15 13:28:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-02-15 13:28:02,254 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 56 [2023-02-15 13:28:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:02,255 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-02-15 13:28:02,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 2.020408163265306) internal successors, (99), 45 states have internal predecessors, (99), 4 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:28:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-02-15 13:28:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:28:02,255 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:02,255 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 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] [2023-02-15 13:28:02,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-02-15 13:28:02,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:02,456 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:28:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2023-02-15 13:28:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:02,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150403493] [2023-02-15 13:28:02,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:02,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 13:28:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 13:28:02,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-02-15 13:28:02,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150403493] [2023-02-15 13:28:02,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150403493] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:02,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531704511] [2023-02-15 13:28:02,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 13:28:02,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:02,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:02,531 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:02,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 13:28:02,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 13:28:02,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:28:02,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:28:02,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:28:02,810 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:28:02,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531704511] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:28:02,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:28:02,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 13:28:02,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114075987] [2023-02-15 13:28:02,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:28:02,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:28:02,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:02,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:28:02,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:28:02,812 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:28:02,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:02,822 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-02-15 13:28:02,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:28:02,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2023-02-15 13:28:02,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:02,823 INFO L225 Difference]: With dead ends: 83 [2023-02-15 13:28:02,823 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 13:28:02,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:28:02,824 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:02,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:28:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 13:28:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 13:28:02,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:02,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-15 13:28:02,826 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2023-02-15 13:28:02,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:02,826 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-15 13:28:02,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 13:28:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-15 13:28:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 13:28:02,827 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:02,827 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2023-02-15 13:28:02,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:03,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:03,033 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:28:03,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:03,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2023-02-15 13:28:03,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:03,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690951742] [2023-02-15 13:28:03,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:03,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:05,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:05,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690951742] [2023-02-15 13:28:05,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690951742] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:05,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056253174] [2023-02-15 13:28:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:05,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:05,266 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:05,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 13:28:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:05,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 166 conjunts are in the unsatisfiable core [2023-02-15 13:28:05,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:05,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:05,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:05,726 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:05,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:28:05,844 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:05,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:28:05,949 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 13:28:05,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:28:06,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:06,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:06,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:28:06,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:06,262 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:06,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2023-02-15 13:28:06,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:28:06,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:28:06,495 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:06,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 35 [2023-02-15 13:28:06,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:28:06,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:28:06,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:06,753 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:28:06,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 55 [2023-02-15 13:28:06,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:06,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:06,763 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-02-15 13:28:06,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 33 [2023-02-15 13:28:06,791 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:06,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:28:06,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-02-15 13:28:07,578 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:28:07,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 92 [2023-02-15 13:28:07,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:07,596 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 13:28:07,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 59 [2023-02-15 13:28:07,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:07,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2023-02-15 13:28:07,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:07,697 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:07,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 59 [2023-02-15 13:28:07,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:28:07,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:07,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:07,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 13:28:07,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:07,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2023-02-15 13:28:07,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 13:28:07,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:28:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:07,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:08,119 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 13:28:08,132 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3356 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3352) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3354) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3351) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3353) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 13:28:09,038 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3351 (Array Int Int)) (v_ArrVal_3352 (Array Int Int)) (v_ArrVal_3353 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| Int) (v_ArrVal_3354 (Array Int Int)) (v_ArrVal_3366 (Array Int Int)) (v_ArrVal_3355 (Array Int Int)) (v_ArrVal_3367 (Array Int Int)) (v_ArrVal_3356 (Array Int Int)) (v_ArrVal_3368 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3367)) (.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3368))) (let ((.cse3 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse4 (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select .cse1 .cse3) .cse4))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3366) .cse0 v_ArrVal_3352) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3354) (select (select (store (store .cse1 .cse0 v_ArrVal_3351) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3355) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3353) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3356) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (<= 0 (select (select .cse2 .cse3) .cse4))))))) is different from false [2023-02-15 13:28:09,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056253174] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:09,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:09,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 65 [2023-02-15 13:28:09,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275718725] [2023-02-15 13:28:09,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:09,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-02-15 13:28:09,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:09,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-02-15 13:28:09,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5120, Unknown=4, NotChecked=438, Total=5852 [2023-02-15 13:28:09,042 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:12,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:12,415 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-02-15 13:28:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 13:28:12,416 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2023-02-15 13:28:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:12,418 INFO L225 Difference]: With dead ends: 102 [2023-02-15 13:28:12,419 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 13:28:12,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 97 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=717, Invalid=8411, Unknown=4, NotChecked=570, Total=9702 [2023-02-15 13:28:12,428 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 785 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:12,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1093 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:28:12,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 13:28:12,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2023-02-15 13:28:12,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.28125) internal successors, (82), 78 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:12,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-15 13:28:12,443 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 58 [2023-02-15 13:28:12,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:12,443 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-15 13:28:12,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 61 states have (on average 1.6065573770491803) internal successors, (98), 56 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:12,448 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-15 13:28:12,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 13:28:12,448 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:12,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:12,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:12,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 13:28:12,649 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:28:12,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:12,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2023-02-15 13:28:12,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:12,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717395722] [2023-02-15 13:28:12,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:12,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:12,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:13,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:14,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717395722] [2023-02-15 13:28:14,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717395722] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:14,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222640946] [2023-02-15 13:28:14,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:14,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:14,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:14,106 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:14,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 13:28:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:14,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-15 13:28:14,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:14,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:14,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:14,525 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:14,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:28:14,606 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:14,680 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 13:28:14,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:28:14,776 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:14,889 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:14,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-15 13:28:15,038 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:15,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 21 [2023-02-15 13:28:15,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-15 13:28:15,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:28:15,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:15,238 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 13:28:15,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 37 [2023-02-15 13:28:15,244 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:15,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:28:15,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:15,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 13:28:15,724 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:28:15,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 73 [2023-02-15 13:28:15,735 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:15,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2023-02-15 13:28:15,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:15,809 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:15,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2023-02-15 13:28:15,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:15,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2023-02-15 13:28:15,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-15 13:28:16,006 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:16,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 24 [2023-02-15 13:28:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:16,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:16,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-15 13:28:16,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-15 13:28:16,044 INFO L321 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2023-02-15 13:28:16,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2023-02-15 13:28:16,049 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|)) is different from false [2023-02-15 13:28:16,054 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-15 13:28:16,059 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (= .cse0 (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2023-02-15 13:28:16,089 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2023-02-15 13:28:16,232 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3557) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3556) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))) is different from false [2023-02-15 13:28:16,276 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| Int) (v_ArrVal_3566 (Array Int Int)) (v_ArrVal_3567 (Array Int Int)) (v_ArrVal_3556 (Array Int Int)) (v_ArrVal_3557 (Array Int Int)) (v_ArrVal_3558 (Array Int Int)) (v_ArrVal_3559 (Array Int Int))) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3567)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3566))) (let ((.cse2 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (= (select (let ((.cse0 (store (store .cse1 .cse2 v_ArrVal_3557) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3558))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store .cse3 .cse2 v_ArrVal_3556) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| v_ArrVal_3559) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_38| |c_#StackHeapBarrier|)))) is different from false [2023-02-15 13:28:16,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222640946] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:16,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:16,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 63 [2023-02-15 13:28:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441327290] [2023-02-15 13:28:16,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:16,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-02-15 13:28:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:16,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-02-15 13:28:16,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=3932, Unknown=55, NotChecked=1064, Total=5256 [2023-02-15 13:28:16,280 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:18,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:18,879 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2023-02-15 13:28:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 13:28:18,879 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2023-02-15 13:28:18,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:18,882 INFO L225 Difference]: With dead ends: 134 [2023-02-15 13:28:18,882 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:28:18,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=618, Invalid=7006, Unknown=64, NotChecked=1432, Total=9120 [2023-02-15 13:28:18,892 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 938 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:18,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1031 Invalid, 2167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-02-15 13:28:18,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:28:18,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2023-02-15 13:28:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 82 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:18,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-02-15 13:28:18,898 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 62 [2023-02-15 13:28:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:18,898 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-02-15 13:28:18,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 55 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:18,899 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-02-15 13:28:18,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 13:28:18,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:18,899 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:18,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 13:28:19,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-15 13:28:19,105 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:28:19,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2023-02-15 13:28:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:19,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621466841] [2023-02-15 13:28:19,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:21,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:21,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621466841] [2023-02-15 13:28:21,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621466841] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:21,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720540602] [2023-02-15 13:28:21,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:21,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:21,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:21,716 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:21,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 13:28:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:22,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 151 conjunts are in the unsatisfiable core [2023-02-15 13:28:22,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:22,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:22,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:22,216 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:22,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:28:22,615 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 13:28:22,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-15 13:28:22,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:28:22,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:22,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:23,067 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:23,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 50 [2023-02-15 13:28:23,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:28:24,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:24,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:28:24,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:24,043 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:24,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 65 [2023-02-15 13:28:24,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:24,076 INFO L321 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2023-02-15 13:28:24,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 42 [2023-02-15 13:28:24,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:24,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:24,109 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-02-15 13:28:24,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2023-02-15 13:28:25,047 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:28:25,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 84 [2023-02-15 13:28:25,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:25,073 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 13:28:25,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2023-02-15 13:28:25,191 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:25,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 63 [2023-02-15 13:28:25,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:25,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 13:28:25,573 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 13:28:25,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2023-02-15 13:28:25,806 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:28:25,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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 [2023-02-15 13:28:25,902 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:28:25,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:26,349 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 4))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_3765 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3765))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3764 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3764))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 8) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2023-02-15 13:28:32,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720540602] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:32,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:32,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35] total 76 [2023-02-15 13:28:32,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534296665] [2023-02-15 13:28:32,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:32,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-02-15 13:28:32,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:32,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-02-15 13:28:32,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=7453, Unknown=109, NotChecked=174, Total=8010 [2023-02-15 13:28:32,562 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:44,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:28:44,137 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2023-02-15 13:28:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 13:28:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 62 [2023-02-15 13:28:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:28:44,138 INFO L225 Difference]: With dead ends: 156 [2023-02-15 13:28:44,138 INFO L226 Difference]: Without dead ends: 156 [2023-02-15 13:28:44,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1964 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=924, Invalid=12543, Unknown=109, NotChecked=230, Total=13806 [2023-02-15 13:28:44,139 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 2110 mSDsluCounter, 1250 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2110 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 3119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:28:44,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2110 Valid, 1281 Invalid, 3119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3063 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-02-15 13:28:44,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-15 13:28:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 89. [2023-02-15 13:28:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:28:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-15 13:28:44,141 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 62 [2023-02-15 13:28:44,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:28:44,142 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-15 13:28:44,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 67 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-15 13:28:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-15 13:28:44,142 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:28:44,142 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:28:44,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-15 13:28:44,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-15 13:28:44,352 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:28:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:28:44,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1350141375, now seen corresponding path program 1 times [2023-02-15 13:28:44,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:28:44,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097034728] [2023-02-15 13:28:44,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:44,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:28:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:28:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:45,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:28:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:28:46,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:28:46,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:28:46,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097034728] [2023-02-15 13:28:46,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097034728] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:46,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967554296] [2023-02-15 13:28:46,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:28:46,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:28:46,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:28:46,730 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:28:46,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-15 13:28:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:28:46,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 124 conjunts are in the unsatisfiable core [2023-02-15 13:28:46,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:28:46,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:28:47,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:28:47,259 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:28:47,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:28:47,453 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:47,627 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 13:28:47,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:28:47,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:28:48,131 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:48,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-15 13:28:48,502 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:48,509 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:28:48,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2023-02-15 13:28:48,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:28:49,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:49,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2023-02-15 13:28:49,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:49,076 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:28:49,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 50 [2023-02-15 13:28:49,093 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:28:49,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:28:50,194 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:28:50,217 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2023-02-15 13:28:50,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 50 [2023-02-15 13:28:50,235 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:28:50,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 83 [2023-02-15 13:28:50,464 INFO L321 Elim1Store]: treesize reduction 62, result has 24.4 percent of original size [2023-02-15 13:28:50,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 89 [2023-02-15 13:28:50,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:28:50,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 86 [2023-02-15 13:28:50,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-02-15 13:28:50,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 90 [2023-02-15 13:28:51,514 INFO L321 Elim1Store]: treesize reduction 20, result has 71.0 percent of original size [2023-02-15 13:28:51,514 INFO L350 Elim1Store]: Elim1 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 105 [2023-02-15 13:28:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:28:52,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:28:52,092 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-15 13:28:52,100 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_append_~last~1#1.offset| Int) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-15 13:28:52,480 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset|))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-02-15 13:28:52,500 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 13:28:52,515 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 13:28:52,531 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3964 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse2 (store (select |c_#memory_$Pointer$.base| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3964) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 13:28:52,597 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| Int) (v_ArrVal_3975 (Array Int Int)) (v_ArrVal_3964 (Array Int Int)) (v_ArrVal_3976 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| Int) (v_ArrVal_3967 (Array Int Int)) (v_ArrVal_3968 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|) 0)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| |c_#StackHeapBarrier|)) (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3975)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3976))) (let ((.cse3 (select (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse1 (store (store .cse4 .cse3 (store (select .cse4 .cse3) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_32| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3967))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store .cse2 .cse3 v_ArrVal_3964) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_44| v_ArrVal_3968) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) is different from false [2023-02-15 13:28:52,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967554296] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:28:52,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:28:52,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 66 [2023-02-15 13:28:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017208113] [2023-02-15 13:28:52,603 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:28:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-15 13:28:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:28:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-15 13:28:52,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=4174, Unknown=56, NotChecked=952, Total=5402 [2023-02-15 13:28:52,608 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:28:56,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:29:01,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:29:01,030 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2023-02-15 13:29:01,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-15 13:29:01,030 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2023-02-15 13:29:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:29:01,031 INFO L225 Difference]: With dead ends: 110 [2023-02-15 13:29:01,031 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 13:29:01,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1455 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=626, Invalid=7531, Unknown=61, NotChecked=1288, Total=9506 [2023-02-15 13:29:01,032 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 750 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1977 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1977 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:29:01,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 1192 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1977 Invalid, 3 Unknown, 0 Unchecked, 3.8s Time] [2023-02-15 13:29:01,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 13:29:01,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2023-02-15 13:29:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:29:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 13:29:01,033 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 63 [2023-02-15 13:29:01,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:29:01,034 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 13:29:01,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.7580645161290323) internal successors, (109), 57 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:29:01,034 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 13:29:01,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 13:29:01,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:29:01,034 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:29:01,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-02-15 13:29:01,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:01,241 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:29:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:29:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2023-02-15 13:29:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:29:01,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637348450] [2023-02-15 13:29:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:29:01,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:04,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:29:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:04,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:29:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:05,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:29:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:29:06,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:06,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637348450] [2023-02-15 13:29:06,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637348450] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:06,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869084574] [2023-02-15 13:29:06,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:06,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:06,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:29:06,099 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:29:06,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-15 13:29:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:06,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 203 conjunts are in the unsatisfiable core [2023-02-15 13:29:06,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:29:06,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:29:06,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:29:06,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:06,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:06,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:29:07,079 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:29:07,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:29:07,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:29:07,424 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:07,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:29:07,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:08,202 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:29:08,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:29:08,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:08,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:08,244 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:29:08,256 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:08,264 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:08,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 13:29:08,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:29:08,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:08,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:08,997 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:29:08,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 67 [2023-02-15 13:29:09,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:29:09,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-15 13:29:09,581 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:29:09,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 39 [2023-02-15 13:29:09,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:09,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:29:09,591 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2023-02-15 13:29:09,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-02-15 13:29:09,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:10,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:10,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:29:10,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:10,262 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:29:10,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 74 [2023-02-15 13:29:10,290 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 13:29:10,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-15 13:29:10,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:10,323 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:29:10,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 13:29:10,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:10,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:10,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 13:29:12,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:12,034 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:29:12,789 INFO L321 Elim1Store]: treesize reduction 151, result has 10.7 percent of original size [2023-02-15 13:29:12,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 231 treesize of output 105 [2023-02-15 13:29:12,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:12,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2023-02-15 13:29:12,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:12,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 57 [2023-02-15 13:29:13,061 INFO L321 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2023-02-15 13:29:13,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 223 treesize of output 160 [2023-02-15 13:29:13,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:13,085 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 13:29:13,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 144 [2023-02-15 13:29:13,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2023-02-15 13:29:13,814 INFO L321 Elim1Store]: treesize reduction 48, result has 20.0 percent of original size [2023-02-15 13:29:13,815 INFO L350 Elim1Store]: Elim1 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 75 [2023-02-15 13:29:13,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:13,827 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:29:13,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 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 [2023-02-15 13:29:14,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:29:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:29:14,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:29:15,395 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4182 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4182) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4185)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4187))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| v_ArrVal_4183)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4186) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2023-02-15 13:29:18,227 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4185 (Array Int Int)) (v_ArrVal_4183 Int) (v_ArrVal_4186 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| Int) (v_ArrVal_4187 (Array Int Int)) (v_ArrVal_4199 (Array Int Int)) (v_ArrVal_4201 (Array Int Int)) (v_ArrVal_4202 (Array Int Int)) (v_ArrVal_4200 Int) (v_ArrVal_4182 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4201)) (.cse7 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4202))) (let ((.cse11 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse10 (select (select .cse9 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (let ((.cse1 (select (select .cse7 .cse11) .cse10))) (let ((.cse8 (select .cse7 .cse1)) (.cse2 (select (select .cse9 .cse11) .cse10))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (store (store .cse9 .cse1 v_ArrVal_4182) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4185)) (.cse3 (store (store .cse7 .cse1 (store .cse8 .cse2 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|)) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4187))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4199))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_4183))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4186) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) (not (<= (+ .cse2 4) (select (store |c_#length| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| v_ArrVal_4200) .cse1))) (not (<= 0 .cse10)) (not (<= 0 .cse2)) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47| |c_#StackHeapBarrier|)) (not (= (select .cse8 .cse2) .cse11)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_47|) 0)))))))) is different from false [2023-02-15 13:29:18,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869084574] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:18,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:29:18,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 40] total 79 [2023-02-15 13:29:18,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723186781] [2023-02-15 13:29:18,231 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:29:18,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-02-15 13:29:18,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:29:18,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-02-15 13:29:18,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=8297, Unknown=89, NotChecked=370, Total=9120 [2023-02-15 13:29:18,232 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:29:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:29:32,802 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2023-02-15 13:29:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 13:29:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 64 [2023-02-15 13:29:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:29:32,803 INFO L225 Difference]: With dead ends: 108 [2023-02-15 13:29:32,803 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 13:29:32,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 124 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3064 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=1049, Invalid=14100, Unknown=111, NotChecked=490, Total=15750 [2023-02-15 13:29:32,804 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 716 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 2978 mSolverCounterSat, 32 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2978 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:29:32,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 1053 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2978 Invalid, 4 Unknown, 0 Unchecked, 4.2s Time] [2023-02-15 13:29:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 13:29:32,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-02-15 13:29:32,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 84 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:29:32,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-02-15 13:29:32,806 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 64 [2023-02-15 13:29:32,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:29:32,806 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-02-15 13:29:32,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 75 states have (on average 1.52) internal successors, (114), 70 states have internal predecessors, (114), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:29:32,806 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-02-15 13:29:32,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 13:29:32,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:29:32,806 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:29:32,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-15 13:29:33,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 13:29:33,016 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:29:33,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:29:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2023-02-15 13:29:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:29:33,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898004966] [2023-02-15 13:29:33,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:29:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:29:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:35,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:29:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:35,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:29:35,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:35,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:29:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:29:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:29:36,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:29:36,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898004966] [2023-02-15 13:29:36,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898004966] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:29:36,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598549690] [2023-02-15 13:29:36,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:29:36,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:29:36,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:29:36,553 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:29:36,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-15 13:29:36,855 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:29:36,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:29:36,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 188 conjunts are in the unsatisfiable core [2023-02-15 13:29:36,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:29:36,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:29:36,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:37,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:29:37,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:37,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:29:37,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:37,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:37,567 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:37,956 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:29:37,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:29:37,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:37,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:37,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2023-02-15 13:29:38,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:29:38,600 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:29:38,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-02-15 13:29:39,150 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:29:39,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2023-02-15 13:29:39,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:29:39,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:39,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-02-15 13:29:39,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:29:40,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:40,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:29:40,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:40,035 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:29:40,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 57 [2023-02-15 13:29:40,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:40,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:40,057 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 13:29:40,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 42 [2023-02-15 13:29:40,081 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:29:40,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:29:42,511 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:29:42,548 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-15 13:29:42,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 209 treesize of output 122 [2023-02-15 13:29:42,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:42,583 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-02-15 13:29:42,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 121 [2023-02-15 13:29:43,148 INFO L321 Elim1Store]: treesize reduction 88, result has 27.9 percent of original size [2023-02-15 13:29:43,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 427 treesize of output 160 [2023-02-15 13:29:43,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:43,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:29:43,175 INFO L321 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2023-02-15 13:29:43,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 217 treesize of output 147 [2023-02-15 13:29:45,955 INFO L321 Elim1Store]: treesize reduction 48, result has 72.9 percent of original size [2023-02-15 13:29:45,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 401 treesize of output 467 [2023-02-15 13:29:50,629 INFO L321 Elim1Store]: treesize reduction 172, result has 62.7 percent of original size [2023-02-15 13:29:50,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 18 new quantified variables, introduced 45 case distinctions, treesize of input 362 treesize of output 482 [2023-02-15 13:29:50,865 INFO L321 Elim1Store]: treesize reduction 72, result has 69.6 percent of original size [2023-02-15 13:29:50,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 318 treesize of output 355 [2023-02-15 13:30:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:30:03,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:30:06,790 INFO L321 Elim1Store]: treesize reduction 18, result has 98.3 percent of original size [2023-02-15 13:30:06,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 550 treesize of output 1082 [2023-02-15 13:30:11,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598549690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:11,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:30:11,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 42] total 78 [2023-02-15 13:30:11,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729560463] [2023-02-15 13:30:11,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:30:11,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-02-15 13:30:11,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:30:11,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-02-15 13:30:11,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=9298, Unknown=3, NotChecked=0, Total=9702 [2023-02-15 13:30:11,014 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:30:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:30:27,921 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2023-02-15 13:30:27,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-15 13:30:27,921 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 68 [2023-02-15 13:30:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:30:27,922 INFO L225 Difference]: With dead ends: 178 [2023-02-15 13:30:27,922 INFO L226 Difference]: Without dead ends: 178 [2023-02-15 13:30:27,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3797 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=1308, Invalid=16777, Unknown=5, NotChecked=0, Total=18090 [2023-02-15 13:30:27,923 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 1723 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1723 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 3405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:30:27,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1723 Valid, 1238 Invalid, 3405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3370 Invalid, 2 Unknown, 0 Unchecked, 4.4s Time] [2023-02-15 13:30:27,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-15 13:30:27,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 99. [2023-02-15 13:30:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3) internal successors, (104), 94 states have internal predecessors, (104), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:30:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2023-02-15 13:30:27,931 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 68 [2023-02-15 13:30:27,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:30:27,931 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2023-02-15 13:30:27,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 74 states have (on average 1.662162162162162) internal successors, (123), 69 states have internal predecessors, (123), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:30:27,931 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2023-02-15 13:30:27,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 13:30:27,932 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:30:27,932 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:30:27,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-15 13:30:28,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:28,134 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 13:30:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:30:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2023-02-15 13:30:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:30:28,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114740888] [2023-02-15 13:30:28,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:30:28,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:30:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:30:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:31,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 13:30:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:31,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 13:30:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:30:32,403 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:30:32,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:30:32,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114740888] [2023-02-15 13:30:32,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114740888] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:30:32,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165113495] [2023-02-15 13:30:32,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 13:30:32,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:30:32,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:30:32,404 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:30:32,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-15 13:30:32,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 13:30:32,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 13:30:32,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 157 conjunts are in the unsatisfiable core [2023-02-15 13:30:32,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:30:33,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 13:30:33,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:30:33,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:30:34,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:34,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 13:30:34,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:34,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-15 13:30:34,240 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:30:34,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:30:35,831 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:35,832 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:35,855 INFO L321 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2023-02-15 13:30:35,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 159 treesize of output 106 [2023-02-15 13:30:35,860 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:35,896 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-02-15 13:30:35,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 137 treesize of output 84 [2023-02-15 13:30:36,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:36,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:36,372 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:36,421 INFO L321 Elim1Store]: treesize reduction 156, result has 29.7 percent of original size [2023-02-15 13:30:36,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 124 treesize of output 143 [2023-02-15 13:30:36,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:36,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:30:36,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:30:36,547 INFO L321 Elim1Store]: treesize reduction 116, result has 46.5 percent of original size [2023-02-15 13:30:36,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 136 treesize of output 184 [2023-02-15 13:30:48,005 INFO L321 Elim1Store]: treesize reduction 524, result has 58.2 percent of original size [2023-02-15 13:30:48,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 31 new quantified variables, introduced 105 case distinctions, treesize of input 690 treesize of output 1082 [2023-02-15 13:30:49,851 INFO L321 Elim1Store]: treesize reduction 427, result has 64.3 percent of original size [2023-02-15 13:30:49,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 22 new quantified variables, introduced 105 case distinctions, treesize of input 1191 treesize of output 1497