./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 e8d55036 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-?-e8d5503-m [2023-02-15 22:27:44,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:27:44,379 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:27:44,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:27:44,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:27:44,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:27:44,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:27:44,420 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:27:44,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:27:44,425 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:27:44,425 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:27:44,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:27:44,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:27:44,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:27:44,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:27:44,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:27:44,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:27:44,430 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:27:44,432 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:27:44,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:27:44,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:27:44,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:27:44,439 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:27:44,440 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:27:44,444 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:27:44,444 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:27:44,445 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:27:44,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:27:44,446 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:27:44,447 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:27:44,447 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:27:44,448 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:27:44,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:27:44,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:27:44,450 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:27:44,450 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:27:44,450 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:27:44,451 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:27:44,451 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:27:44,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:27:44,452 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:27:44,453 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:27:44,476 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:27:44,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:27:44,477 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:27:44,477 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:27:44,478 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:27:44,478 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:27:44,478 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:27:44,478 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:27:44,478 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:27:44,479 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:27:44,479 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:27:44,479 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:27:44,479 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:27:44,480 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:27:44,480 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:27:44,480 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:27:44,480 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:27:44,480 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:27:44,480 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:27:44,480 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:27:44,481 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:27:44,481 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:27:44,481 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:27:44,481 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:27:44,481 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:27:44,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:27:44,482 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:27:44,482 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:27:44,482 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:27:44,482 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:27:44,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:27:44,482 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:27:44,483 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:27:44,483 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:27:44,483 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 22:27:44,654 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:27:44,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:27:44,690 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:27:44,691 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:27:44,694 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:27:44,695 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 22:27:45,794 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:27:45,975 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:27:45,975 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_equal.i [2023-02-15 22:27:45,985 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7577a51/81c1e7269b594e279be5cbe72e73f053/FLAGea41a4478 [2023-02-15 22:27:45,998 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a7577a51/81c1e7269b594e279be5cbe72e73f053 [2023-02-15 22:27:46,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:27:46,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:27:46,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:27:46,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:27:46,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:27:46,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:27:45" (1/1) ... [2023-02-15 22:27:46,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64299a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46, skipping insertion in model container [2023-02-15 22:27:46,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:27:45" (1/1) ... [2023-02-15 22:27:46,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:27:46,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:27:46,294 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 22:27:46,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:27:46,308 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:27:46,349 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 22:27:46,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:27:46,373 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:27:46,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46 WrapperNode [2023-02-15 22:27:46,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:27:46,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:27:46,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:27:46,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:27:46,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,423 INFO L138 Inliner]: procedures = 127, calls = 42, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 142 [2023-02-15 22:27:46,423 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:27:46,424 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:27:46,424 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:27:46,424 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:27:46,430 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,443 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,453 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:27:46,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:27:46,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:27:46,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:27:46,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (1/1) ... [2023-02-15 22:27:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:27:46,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:46,500 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 22:27:46,506 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 22:27:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 22:27:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 22:27:46,531 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 22:27:46,532 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 22:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:27:46,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:27:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:27:46,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:27:46,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:27:46,655 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:27:46,657 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:27:46,968 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:27:46,974 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:27:46,974 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 22:27:46,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:27:46 BoogieIcfgContainer [2023-02-15 22:27:46,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:27:46,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:27:46,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:27:46,979 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:27:46,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:27:45" (1/3) ... [2023-02-15 22:27:46,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c83f9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:27:46, skipping insertion in model container [2023-02-15 22:27:46,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:27:46" (2/3) ... [2023-02-15 22:27:46,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c83f9e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:27:46, skipping insertion in model container [2023-02-15 22:27:46,981 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:27:46" (3/3) ... [2023-02-15 22:27:46,983 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_append_equal.i [2023-02-15 22:27:46,998 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:27:46,999 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 50 error locations. [2023-02-15 22:27:47,029 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:27:47,033 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;@48b520f0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:27:47,033 INFO L358 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2023-02-15 22:27:47,036 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 22:27:47,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:27:47,040 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:47,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:27:47,041 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 22:27:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 895059861, now seen corresponding path program 1 times [2023-02-15 22:27:47,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:47,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620480049] [2023-02-15 22:27:47,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:47,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:47,195 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 22:27:47,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:47,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620480049] [2023-02-15 22:27:47,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620480049] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:47,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:47,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:27:47,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752829114] [2023-02-15 22:27:47,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:47,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:27:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:47,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:27:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:27:47,222 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 22:27:47,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:47,296 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2023-02-15 22:27:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:27:47,298 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 22:27:47,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:47,303 INFO L225 Difference]: With dead ends: 114 [2023-02-15 22:27:47,303 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 22:27:47,305 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 22:27:47,309 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 8 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 22:27:47,310 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 22:27:47,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 22:27:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-15 22:27:47,333 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 22:27:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2023-02-15 22:27:47,335 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 6 [2023-02-15 22:27:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:47,335 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2023-02-15 22:27:47,336 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 22:27:47,336 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2023-02-15 22:27:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:27:47,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:47,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:27:47,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:27:47,337 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 22:27:47,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:47,337 INFO L85 PathProgramCache]: Analyzing trace with hash 895059862, now seen corresponding path program 1 times [2023-02-15 22:27:47,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:47,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776572409] [2023-02-15 22:27:47,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:47,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:47,407 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 22:27:47,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:47,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776572409] [2023-02-15 22:27:47,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776572409] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:47,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:47,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:27:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947729744] [2023-02-15 22:27:47,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:47,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:27:47,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:47,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:27:47,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:27:47,410 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 22:27:47,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:47,490 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2023-02-15 22:27:47,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:27:47,490 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 22:27:47,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:47,492 INFO L225 Difference]: With dead ends: 109 [2023-02-15 22:27:47,493 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:27:47,493 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 22:27:47,494 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:47,495 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.1s Time] [2023-02-15 22:27:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:27:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-15 22:27:47,502 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 22:27:47,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2023-02-15 22:27:47,505 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 6 [2023-02-15 22:27:47,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:47,505 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2023-02-15 22:27:47,506 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 22:27:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2023-02-15 22:27:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:27:47,508 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:47,508 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:27:47,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:27:47,508 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 22:27:47,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash 100467671, now seen corresponding path program 1 times [2023-02-15 22:27:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:47,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315461276] [2023-02-15 22:27:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:47,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:47,584 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 22:27:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:47,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315461276] [2023-02-15 22:27:47,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315461276] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:47,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:47,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:27:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270674791] [2023-02-15 22:27:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:47,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:27:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:47,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:27:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:27:47,588 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 22:27:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:47,662 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-02-15 22:27:47,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:27:47,662 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 22:27:47,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:47,663 INFO L225 Difference]: With dead ends: 116 [2023-02-15 22:27:47,663 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 22:27:47,664 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 22:27:47,664 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 22:27:47,665 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 22:27:47,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 22:27:47,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-02-15 22:27:47,671 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 22:27:47,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2023-02-15 22:27:47,671 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 13 [2023-02-15 22:27:47,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:47,672 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2023-02-15 22:27:47,672 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 22:27:47,672 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2023-02-15 22:27:47,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:27:47,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:47,673 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:27:47,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:27:47,673 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 22:27:47,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:47,674 INFO L85 PathProgramCache]: Analyzing trace with hash -900354020, now seen corresponding path program 1 times [2023-02-15 22:27:47,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:47,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277797915] [2023-02-15 22:27:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:47,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:47,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:47,794 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 22:27:47,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:47,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277797915] [2023-02-15 22:27:47,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277797915] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:47,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:47,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:27:47,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149647726] [2023-02-15 22:27:47,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:47,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:27:47,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:47,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:27:47,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:27:47,797 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 22:27:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:47,994 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2023-02-15 22:27:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:27:47,995 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 22:27:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:47,999 INFO L225 Difference]: With dead ends: 110 [2023-02-15 22:27:47,999 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 22:27:47,999 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 22:27:48,006 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 22:27:48,007 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 22:27:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 22:27:48,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2023-02-15 22:27:48,017 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 22:27:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2023-02-15 22:27:48,019 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 22 [2023-02-15 22:27:48,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:48,020 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2023-02-15 22:27:48,020 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 22:27:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2023-02-15 22:27:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:27:48,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:48,021 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:27:48,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:27:48,022 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 22:27:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:48,023 INFO L85 PathProgramCache]: Analyzing trace with hash -900354019, now seen corresponding path program 1 times [2023-02-15 22:27:48,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:48,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278910710] [2023-02-15 22:27:48,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:48,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:48,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:48,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:48,279 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 22:27:48,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:48,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278910710] [2023-02-15 22:27:48,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278910710] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:48,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:48,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:27:48,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301769432] [2023-02-15 22:27:48,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:48,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:27:48,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:48,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:27:48,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:27:48,284 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 22:27:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:48,465 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2023-02-15 22:27:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:27:48,466 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 22:27:48,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:48,467 INFO L225 Difference]: With dead ends: 109 [2023-02-15 22:27:48,470 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 22:27:48,470 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 22:27:48,470 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 22:27:48,472 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 22:27:48,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 22:27:48,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2023-02-15 22:27:48,478 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 22:27:48,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-15 22:27:48,479 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 22 [2023-02-15 22:27:48,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:48,479 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-15 22:27:48,479 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 22:27:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-15 22:27:48,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:27:48,480 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:48,480 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 22:27:48,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:27:48,480 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 22:27:48,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:48,481 INFO L85 PathProgramCache]: Analyzing trace with hash -375857467, now seen corresponding path program 1 times [2023-02-15 22:27:48,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:48,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938597451] [2023-02-15 22:27:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:48,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:48,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:48,683 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 22:27:48,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:48,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938597451] [2023-02-15 22:27:48,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938597451] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:48,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321836584] [2023-02-15 22:27:48,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:48,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:48,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:48,714 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 22:27:48,716 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 22:27:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:48,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 22:27:48,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:48,842 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 22:27:48,874 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 22:27:48,885 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 22:27:48,902 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:27:48,903 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 22:27:48,946 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 22:27:48,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:49,142 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 22:27:49,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321836584] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:27:49,143 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:27:49,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-15 22:27:49,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961152078] [2023-02-15 22:27:49,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:49,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:27:49,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:49,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:27:49,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-15 22:27:49,145 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 22:27:49,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:49,363 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2023-02-15 22:27:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:27:49,364 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 22:27:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:49,365 INFO L225 Difference]: With dead ends: 125 [2023-02-15 22:27:49,365 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 22:27:49,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-15 22:27:49,366 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 22:27:49,366 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 22:27:49,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 22:27:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2023-02-15 22:27:49,369 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 22:27:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2023-02-15 22:27:49,369 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 25 [2023-02-15 22:27:49,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:49,370 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2023-02-15 22:27:49,370 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 22:27:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2023-02-15 22:27:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 22:27:49,370 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:49,371 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 22:27:49,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:27:49,576 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 22:27:49,577 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 22:27:49,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:49,577 INFO L85 PathProgramCache]: Analyzing trace with hash -375857466, now seen corresponding path program 1 times [2023-02-15 22:27:49,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:49,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740082187] [2023-02-15 22:27:49,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:49,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:49,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:27:49,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:49,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740082187] [2023-02-15 22:27:49,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740082187] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:49,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286726360] [2023-02-15 22:27:49,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:49,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:49,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:49,937 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 22:27:49,949 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 22:27:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:50,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 22:27:50,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:50,075 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 22:27:50,079 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 22:27:50,236 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:27:50,236 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 22:27:50,241 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 22:27:50,286 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 22:27:50,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:50,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286726360] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:50,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:50,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-02-15 22:27:50,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696231393] [2023-02-15 22:27:50,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:50,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:27:50,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:50,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:27:50,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:27:50,400 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 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 22:27:50,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:50,890 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-02-15 22:27:50,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:27:50,891 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 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 22:27:50,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:50,892 INFO L225 Difference]: With dead ends: 108 [2023-02-15 22:27:50,892 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 22:27:50,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2023-02-15 22:27:50,892 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:50,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 755 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:27:50,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 22:27:50,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-02-15 22:27:50,895 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 22:27:50,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2023-02-15 22:27:50,895 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 25 [2023-02-15 22:27:50,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:50,895 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2023-02-15 22:27:50,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 13 states have internal predecessors, (40), 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 22:27:50,895 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2023-02-15 22:27:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:27:50,896 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:50,896 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 22:27:50,921 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 22:27:51,101 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 22:27:51,102 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 22:27:51,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:51,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867041, now seen corresponding path program 1 times [2023-02-15 22:27:51,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:51,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113136232] [2023-02-15 22:27:51,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:51,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:51,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:51,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:27:51,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:51,419 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 22:27:51,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113136232] [2023-02-15 22:27:51,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113136232] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:51,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840239964] [2023-02-15 22:27:51,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:51,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:51,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:51,421 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 22:27:51,456 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 22:27:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:51,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 22:27:51,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:51,549 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 22:27:51,559 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 22:27:51,610 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-02-15 22:27:51,610 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 19 treesize of output 16 [2023-02-15 22:27:51,640 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 22:27:51,645 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_523 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_523))) is different from true [2023-02-15 22:27:51,653 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_523 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_523))) is different from true [2023-02-15 22:27:51,665 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:27:51,666 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 22:27:51,769 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 22:27:51,776 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_524 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_524))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:27:51,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:51,817 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 22:27:51,820 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 22:27:51,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:51,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840239964] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:51,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:51,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13] total 18 [2023-02-15 22:27:51,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755217180] [2023-02-15 22:27:51,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:51,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 22:27:51,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:51,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 22:27:51,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=226, Unknown=3, NotChecked=96, Total=380 [2023-02-15 22:27:51,865 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 19 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:27:52,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:52,174 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2023-02-15 22:27:52,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:27:52,175 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2023-02-15 22:27:52,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:52,176 INFO L225 Difference]: With dead ends: 116 [2023-02-15 22:27:52,176 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 22:27:52,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=311, Unknown=3, NotChecked=114, Total=506 [2023-02-15 22:27:52,177 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 162 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:52,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 373 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 529 Invalid, 0 Unknown, 303 Unchecked, 0.3s Time] [2023-02-15 22:27:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 22:27:52,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2023-02-15 22:27:52,179 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 22:27:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2023-02-15 22:27:52,179 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 37 [2023-02-15 22:27:52,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:52,179 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2023-02-15 22:27:52,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 22:27:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2023-02-15 22:27:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:27:52,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:52,180 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 22:27:52,193 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 22:27:52,390 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 22:27:52,391 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 22:27:52,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:52,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1778867040, now seen corresponding path program 1 times [2023-02-15 22:27:52,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:52,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600468216] [2023-02-15 22:27:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:52,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:52,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:27:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:52,779 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 22:27:52,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:52,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600468216] [2023-02-15 22:27:52,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600468216] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:52,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911409928] [2023-02-15 22:27:52,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:52,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:52,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:52,782 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 22:27:52,811 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 22:27:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:52,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-15 22:27:52,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:52,906 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 22:27:52,925 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 22:27:52,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:52,969 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 14 treesize of output 9 [2023-02-15 22:27:53,024 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 22:27:53,080 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:27:53,081 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 22:27:53,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:27:53,234 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:27:53,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 20 treesize of output 27 [2023-02-15 22:27:53,238 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 13 treesize of output 9 [2023-02-15 22:27:53,329 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:27:53,329 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 37 treesize of output 28 [2023-02-15 22:27:53,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 22:27:53,368 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 22:27:53,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:53,397 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 22:27:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 12 not checked. [2023-02-15 22:27:53,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:54,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911409928] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:54,583 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:54,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 26 [2023-02-15 22:27:54,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940308730] [2023-02-15 22:27:54,583 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:54,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 22:27:54,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:54,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 22:27:54,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=680, Unknown=1, NotChecked=52, Total=812 [2023-02-15 22:27:54,584 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 27 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:27:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:55,625 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2023-02-15 22:27:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:27:55,626 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 37 [2023-02-15 22:27:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:55,627 INFO L225 Difference]: With dead ends: 118 [2023-02-15 22:27:55,627 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 22:27:55,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=211, Invalid=1514, Unknown=1, NotChecked=80, Total=1806 [2023-02-15 22:27:55,628 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 399 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:55,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 616 Invalid, 1142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1023 Invalid, 0 Unknown, 98 Unchecked, 0.6s Time] [2023-02-15 22:27:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 22:27:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2023-02-15 22:27:55,630 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 22:27:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-15 22:27:55,631 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 37 [2023-02-15 22:27:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:55,631 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-15 22:27:55,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 22 states have (on average 2.272727272727273) internal successors, (50), 23 states have internal predecessors, (50), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:27:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-15 22:27:55,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:27:55,631 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:55,631 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 22:27:55,640 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 22:27:55,839 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 22:27:55,840 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 22:27:55,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:55,840 INFO L85 PathProgramCache]: Analyzing trace with hash -94242400, now seen corresponding path program 1 times [2023-02-15 22:27:55,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:55,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860008780] [2023-02-15 22:27:55,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:55,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:55,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:27:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:55,924 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 22:27:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:55,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860008780] [2023-02-15 22:27:55,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860008780] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:55,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:55,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:27:55,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423834961] [2023-02-15 22:27:55,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:27:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:27:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:27:55,927 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 22:27:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:56,058 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2023-02-15 22:27:56,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:27:56,058 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 22:27:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:56,059 INFO L225 Difference]: With dead ends: 106 [2023-02-15 22:27:56,059 INFO L226 Difference]: Without dead ends: 106 [2023-02-15 22:27:56,059 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 22:27:56,060 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 22:27:56,060 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 22:27:56,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-15 22:27:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2023-02-15 22:27:56,062 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 22:27:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2023-02-15 22:27:56,062 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 39 [2023-02-15 22:27:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:56,062 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2023-02-15 22:27:56,062 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 22:27:56,062 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2023-02-15 22:27:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-15 22:27:56,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:56,063 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 22:27:56,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 22:27:56,063 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 22:27:56,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:56,063 INFO L85 PathProgramCache]: Analyzing trace with hash -94242399, now seen corresponding path program 1 times [2023-02-15 22:27:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:56,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991069386] [2023-02-15 22:27:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:56,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:56,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:27:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,231 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 22:27:56,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:56,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991069386] [2023-02-15 22:27:56,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991069386] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:56,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:27:56,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:27:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913990160] [2023-02-15 22:27:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:56,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:27:56,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:56,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:27:56,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:27:56,233 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 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 22:27:56,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:56,345 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-15 22:27:56,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:27:56,345 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 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 22:27:56,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:56,346 INFO L225 Difference]: With dead ends: 86 [2023-02-15 22:27:56,346 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 22:27:56,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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 22:27:56,347 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:56,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:27:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 22:27:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-15 22:27:56,348 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 22:27:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-15 22:27:56,348 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 39 [2023-02-15 22:27:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:56,349 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-15 22:27:56,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 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 22:27:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-15 22:27:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:27:56,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:56,349 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 22:27:56,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:27:56,349 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 22:27:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -372386587, now seen corresponding path program 1 times [2023-02-15 22:27:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:56,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580417697] [2023-02-15 22:27:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:27:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,749 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 22:27:56,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:56,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580417697] [2023-02-15 22:27:56,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580417697] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:56,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891286531] [2023-02-15 22:27:56,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:56,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:56,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:56,751 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 22:27:56,777 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 22:27:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:56,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 22:27:56,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:57,082 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 22:27:57,169 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (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|))) is different from true [2023-02-15 22:27:57,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:57,193 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 22:27:57,200 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 22:27:57,201 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 22:27:57,251 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 22:27:57,261 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 22:27:57,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:27:57,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891286531] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:27:57,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:27:57,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2023-02-15 22:27:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711206201] [2023-02-15 22:27:57,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:27:57,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:27:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:57,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:27:57,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2023-02-15 22:27:57,264 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 22:27:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:27:57,605 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2023-02-15 22:27:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:27:57,605 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 22:27:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:27:57,606 INFO L225 Difference]: With dead ends: 128 [2023-02-15 22:27:57,606 INFO L226 Difference]: Without dead ends: 128 [2023-02-15 22:27:57,606 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 22:27:57,607 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 80 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:27:57,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 608 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 515 Invalid, 3 Unknown, 152 Unchecked, 0.3s Time] [2023-02-15 22:27:57,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-02-15 22:27:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2023-02-15 22:27:57,608 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 22:27:57,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2023-02-15 22:27:57,609 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 41 [2023-02-15 22:27:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:27:57,609 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2023-02-15 22:27:57,609 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 22:27:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2023-02-15 22:27:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:27:57,609 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:27:57,609 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 22:27:57,631 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 22:27:57,814 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 22:27:57,814 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 22:27:57,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:27:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -372386586, now seen corresponding path program 1 times [2023-02-15 22:27:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:27:57,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468211306] [2023-02-15 22:27:57,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:27:57,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:58,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:27:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:58,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:27:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:27:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:58,495 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 22:27:58,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:27:58,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468211306] [2023-02-15 22:27:58,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468211306] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:58,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343693294] [2023-02-15 22:27:58,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:27:58,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:27:58,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:27:58,497 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 22:27:58,513 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 22:27:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:27:58,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 71 conjunts are in the unsatisfiable core [2023-02-15 22:27:58,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:27:58,680 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 22:27:58,983 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 22:27:58,987 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 22:27:59,113 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1203 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1203)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1204)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-02-15 22:27:59,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:59,145 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 22:27:59,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:59,150 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 21 treesize of output 21 [2023-02-15 22:27:59,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:27:59,158 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 18 treesize of output 13 [2023-02-15 22:27:59,163 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:27:59,163 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 22:27:59,218 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 22:27:59,221 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 22 treesize of output 10 [2023-02-15 22:27:59,231 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 22:27:59,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:27:59,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343693294] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:27:59,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:27:59,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 28 [2023-02-15 22:27:59,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92255299] [2023-02-15 22:27:59,490 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:27:59,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 22:27:59,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:27:59,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 22:27:59,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=892, Unknown=1, NotChecked=60, Total=1056 [2023-02-15 22:27:59,493 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 29 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 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 22:28:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:00,531 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2023-02-15 22:28:00,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:28:00,532 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 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 22:28:00,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:00,533 INFO L225 Difference]: With dead ends: 138 [2023-02-15 22:28:00,533 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 22:28:00,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=1676, Unknown=1, NotChecked=84, Total=1980 [2023-02-15 22:28:00,534 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 245 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:00,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1185 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1358 Invalid, 0 Unknown, 138 Unchecked, 0.6s Time] [2023-02-15 22:28:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 22:28:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 89. [2023-02-15 22:28:00,535 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 22:28:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2023-02-15 22:28:00,536 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2023-02-15 22:28:00,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:00,536 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2023-02-15 22:28:00,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 2.269230769230769) internal successors, (59), 25 states have internal predecessors, (59), 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 22:28:00,536 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2023-02-15 22:28:00,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:28:00,537 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:00,537 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 22:28:00,547 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 22:28:00,746 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 22:28:00,749 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 22:28:00,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:00,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112687, now seen corresponding path program 1 times [2023-02-15 22:28:00,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:00,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391642864] [2023-02-15 22:28:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:00,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:00,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:00,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:00,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:00,992 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 22:28:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391642864] [2023-02-15 22:28:00,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391642864] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:00,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:00,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:28:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688455655] [2023-02-15 22:28:00,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:00,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:28:00,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:28:00,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:28:00,994 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 22:28:01,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:01,184 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-02-15 22:28:01,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 22:28:01,185 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 22:28:01,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:01,186 INFO L225 Difference]: With dead ends: 152 [2023-02-15 22:28:01,186 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 22:28:01,186 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 22:28:01,186 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:01,186 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.1s Time] [2023-02-15 22:28:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 22:28:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 92. [2023-02-15 22:28:01,188 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 22:28:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-02-15 22:28:01,188 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 44 [2023-02-15 22:28:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:01,189 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-02-15 22:28:01,189 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 22:28:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-02-15 22:28:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:28:01,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:01,189 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 22:28:01,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:28:01,189 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 22:28:01,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:01,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1386112688, now seen corresponding path program 1 times [2023-02-15 22:28:01,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:01,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363059206] [2023-02-15 22:28:01,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:01,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:01,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:01,525 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 22:28:01,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:01,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363059206] [2023-02-15 22:28:01,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363059206] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:01,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:28:01,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:28:01,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306157166] [2023-02-15 22:28:01,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:01,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:28:01,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:01,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:28:01,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:28:01,528 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 22:28:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:01,750 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-15 22:28:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:28:01,751 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 22:28:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:01,751 INFO L225 Difference]: With dead ends: 134 [2023-02-15 22:28:01,751 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 22:28:01,751 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 22:28:01,752 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 165 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:01,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 422 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:28:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 22:28:01,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 94. [2023-02-15 22:28:01,754 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 22:28:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2023-02-15 22:28:01,755 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 44 [2023-02-15 22:28:01,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:01,755 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2023-02-15 22:28:01,755 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 22:28:01,755 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2023-02-15 22:28:01,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:28:01,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:01,756 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 22:28:01,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:28:01,756 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 22:28:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 614432594, now seen corresponding path program 1 times [2023-02-15 22:28:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:01,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962635270] [2023-02-15 22:28:01,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:01,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:01,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:01,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:02,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:02,162 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 22:28:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:02,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962635270] [2023-02-15 22:28:02,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962635270] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:02,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850879826] [2023-02-15 22:28:02,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:02,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:02,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:02,164 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 22:28:02,165 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 22:28:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:02,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:28:02,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:02,532 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 22:28:02,575 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1615 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1615)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:02,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:02,589 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 22:28:02,615 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 22:28:02,633 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 22:28:02,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:02,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850879826] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:02,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:02,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2023-02-15 22:28:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812776798] [2023-02-15 22:28:02,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:02,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 22:28:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:02,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 22:28:02,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=4, NotChecked=50, Total=756 [2023-02-15 22:28:02,742 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 22:28:03,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:03,159 INFO L93 Difference]: Finished difference Result 90 states and 99 transitions. [2023-02-15 22:28:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:28:03,160 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 22:28:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:03,160 INFO L225 Difference]: With dead ends: 90 [2023-02-15 22:28:03,160 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 22:28:03,161 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 22:28:03,161 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 362 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:03,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 630 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 427 Invalid, 0 Unknown, 90 Unchecked, 0.2s Time] [2023-02-15 22:28:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 22:28:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2023-02-15 22:28:03,163 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 22:28:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-15 22:28:03,163 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 46 [2023-02-15 22:28:03,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:03,163 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-15 22:28:03,163 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 22:28:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-15 22:28:03,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:28:03,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:03,164 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 22:28:03,173 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 22:28:03,372 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 22:28:03,373 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 22:28:03,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:03,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450120, now seen corresponding path program 1 times [2023-02-15 22:28:03,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:03,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488681350] [2023-02-15 22:28:03,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:03,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:04,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:04,334 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 22:28:04,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:04,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488681350] [2023-02-15 22:28:04,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488681350] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:04,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125129662] [2023-02-15 22:28:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:04,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:04,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:04,342 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 22:28:04,344 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 22:28:04,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:04,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-15 22:28:04,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:04,528 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 22:28:04,673 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:04,673 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 22:28:04,745 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 22:28:04,849 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:04,850 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 22:28:04,983 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:04,984 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 47 treesize of output 22 [2023-02-15 22:28:04,987 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 22:28:04,990 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 22:28:05,111 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 (= |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)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|)) |c_#valid|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:05,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:05,163 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:05,164 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 53 treesize of output 51 [2023-02-15 22:28:05,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:05,186 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 51 treesize of output 49 [2023-02-15 22:28:05,213 INFO L321 Elim1Store]: treesize reduction 88, result has 36.7 percent of original size [2023-02-15 22:28:05,213 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 40 treesize of output 60 [2023-02-15 22:28:05,290 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 52 treesize of output 36 [2023-02-15 22:28:05,434 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:05,434 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 22:28:05,530 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 22:28:05,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:05,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125129662] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:05,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:05,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2023-02-15 22:28:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310954870] [2023-02-15 22:28:05,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:05,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-02-15 22:28:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:05,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-02-15 22:28:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1924, Unknown=1, NotChecked=88, Total=2162 [2023-02-15 22:28:05,698 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 22:28:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:07,332 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2023-02-15 22:28:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 22:28:07,333 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 22:28:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:07,334 INFO L225 Difference]: With dead ends: 183 [2023-02-15 22:28:07,334 INFO L226 Difference]: Without dead ends: 183 [2023-02-15 22:28:07,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=392, Invalid=3517, Unknown=1, NotChecked=122, Total=4032 [2023-02-15 22:28:07,335 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 449 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:07,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1087 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1602 Invalid, 0 Unknown, 158 Unchecked, 0.8s Time] [2023-02-15 22:28:07,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-15 22:28:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2023-02-15 22:28:07,337 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 22:28:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2023-02-15 22:28:07,337 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 46 [2023-02-15 22:28:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:07,338 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2023-02-15 22:28:07,338 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 22:28:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2023-02-15 22:28:07,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:28:07,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:07,338 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 22:28:07,353 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 22:28:07,551 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 22:28:07,552 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 22:28:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2046450121, now seen corresponding path program 1 times [2023-02-15 22:28:07,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:07,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624493843] [2023-02-15 22:28:07,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:07,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:08,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:08,846 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:08,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624493843] [2023-02-15 22:28:08,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624493843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:08,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012565046] [2023-02-15 22:28:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:08,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:08,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:08,848 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 22:28:08,850 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 22:28:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:09,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-15 22:28:09,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:09,046 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 22:28:09,280 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:09,280 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 22:28:09,375 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 22:28:09,379 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 22:28:09,516 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:09,516 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 22:28:09,522 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 22:28:09,706 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:09,706 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 79 treesize of output 38 [2023-02-15 22:28:09,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2023-02-15 22:28:09,862 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1955 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1955))) (exists ((v_ArrVal_1958 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1958))) (exists ((v_ArrVal_1959 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1959))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:09,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:09,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 22:28:09,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:09,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:09,901 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 22:28:09,902 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 83 treesize of output 80 [2023-02-15 22:28:09,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:09,913 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:28:09,913 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 85 treesize of output 75 [2023-02-15 22:28:09,928 INFO L321 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2023-02-15 22:28:09,928 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 32 treesize of output 34 [2023-02-15 22:28:10,193 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:28:10,193 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 83 treesize of output 42 [2023-02-15 22:28:10,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-02-15 22:28:10,260 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 22:28:10,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:10,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012565046] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:10,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:10,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2023-02-15 22:28:10,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131285612] [2023-02-15 22:28:10,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:10,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 22:28:10,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:10,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 22:28:10,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3121, Unknown=2, NotChecked=112, Total=3422 [2023-02-15 22:28:10,727 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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 22:28:12,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:12,847 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2023-02-15 22:28:12,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-15 22:28:12,847 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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 22:28:12,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:12,848 INFO L225 Difference]: With dead ends: 213 [2023-02-15 22:28:12,849 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 22:28:12,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1377 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=413, Invalid=5595, Unknown=2, NotChecked=152, Total=6162 [2023-02-15 22:28:12,850 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 347 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 2865 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 3056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:12,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 2211 Invalid, 3056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2865 Invalid, 0 Unknown, 170 Unchecked, 1.1s Time] [2023-02-15 22:28:12,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 22:28:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 105. [2023-02-15 22:28:12,853 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 22:28:12,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2023-02-15 22:28:12,853 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 46 [2023-02-15 22:28:12,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:12,854 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2023-02-15 22:28:12,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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 22:28:12,854 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2023-02-15 22:28:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:28:12,855 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:12,855 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 22:28:12,878 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 22:28:13,072 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 22:28:13,073 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 22:28:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash 865523061, now seen corresponding path program 1 times [2023-02-15 22:28:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:13,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919767075] [2023-02-15 22:28:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,724 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:13,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919767075] [2023-02-15 22:28:13,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919767075] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:13,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401287703] [2023-02-15 22:28:13,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:13,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:13,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:13,726 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 22:28:13,728 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 22:28:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:13,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 22:28:13,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:14,121 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 22:28:14,123 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 22:28:14,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:14,290 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 22:28:14,300 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 22:28:14,300 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 21 treesize of output 29 [2023-02-15 22:28:14,557 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:14,558 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 54 treesize of output 51 [2023-02-15 22:28:14,631 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:14,632 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 50 treesize of output 46 [2023-02-15 22:28:14,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 22:28:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:28:14,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:28:14,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401287703] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:28:14,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:28:14,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [23] total 41 [2023-02-15 22:28:14,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015515431] [2023-02-15 22:28:14,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:28:14,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 22:28:14,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 22:28:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1601, Unknown=1, NotChecked=0, Total=1722 [2023-02-15 22:28:14,695 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 23 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:28:15,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:15,748 INFO L93 Difference]: Finished difference Result 178 states and 194 transitions. [2023-02-15 22:28:15,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:28:15,748 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-15 22:28:15,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:15,752 INFO L225 Difference]: With dead ends: 178 [2023-02-15 22:28:15,752 INFO L226 Difference]: Without dead ends: 178 [2023-02-15 22:28:15,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=304, Invalid=2665, Unknown=1, NotChecked=0, Total=2970 [2023-02-15 22:28:15,753 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 585 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:15,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 529 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 839 Invalid, 2 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:28:15,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-15 22:28:15,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 116. [2023-02-15 22:28:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 109 states have internal predecessors, (120), 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 22:28:15,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 130 transitions. [2023-02-15 22:28:15,767 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 130 transitions. Word has length 51 [2023-02-15 22:28:15,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:15,768 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 130 transitions. [2023-02-15 22:28:15,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.142857142857143) internal successors, (45), 20 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:28:15,768 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 130 transitions. [2023-02-15 22:28:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:28:15,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:15,770 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 22:28:15,776 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 22:28:15,976 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 22:28:15,976 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 22:28:15,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:15,977 INFO L85 PathProgramCache]: Analyzing trace with hash 865523062, now seen corresponding path program 1 times [2023-02-15 22:28:15,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:15,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455206742] [2023-02-15 22:28:15,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:15,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:16,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:16,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:16,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:16,898 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 22:28:16,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:16,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455206742] [2023-02-15 22:28:16,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455206742] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:16,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014909934] [2023-02-15 22:28:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:16,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:16,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:16,913 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 22:28:16,916 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 22:28:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:17,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 80 conjunts are in the unsatisfiable core [2023-02-15 22:28:17,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:17,130 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 22:28:17,447 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 22:28:17,452 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 22:28:17,458 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 22:28:17,460 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 22:28:17,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:17,684 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 22:28:17,695 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:28:17,695 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 26 [2023-02-15 22:28:17,718 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:28:17,718 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 22:28:17,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:17,726 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 21 treesize of output 21 [2023-02-15 22:28:18,114 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:28:18,115 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 22:28:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:18,122 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 25 treesize of output 25 [2023-02-15 22:28:18,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:18,185 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 33 treesize of output 31 [2023-02-15 22:28:18,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:18,194 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 21 treesize of output 21 [2023-02-15 22:28:18,254 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 22:28:18,258 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 22 treesize of output 10 [2023-02-15 22:28:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:28:18,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:18,444 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2341 (Array Int Int)) (v_ArrVal_2340 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2340) |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_2341) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2340 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2340) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-15 22:28:19,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014909934] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:19,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:19,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22] total 47 [2023-02-15 22:28:19,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451451165] [2023-02-15 22:28:19,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:19,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:28:19,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:19,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:28:19,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2746, Unknown=52, NotChecked=106, Total=3080 [2023-02-15 22:28:19,154 INFO L87 Difference]: Start difference. First operand 116 states and 130 transitions. Second operand has 47 states, 44 states have (on average 2.0) internal successors, (88), 41 states have internal predecessors, (88), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:28:21,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:21,955 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2023-02-15 22:28:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-02-15 22:28:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.0) internal successors, (88), 41 states have internal predecessors, (88), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2023-02-15 22:28:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:21,956 INFO L225 Difference]: With dead ends: 171 [2023-02-15 22:28:21,956 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 22:28:21,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=566, Invalid=6524, Unknown=54, NotChecked=166, Total=7310 [2023-02-15 22:28:21,958 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 526 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 27 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 2016 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:21,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 2016 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2669 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 22:28:21,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 22:28:21,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 118. [2023-02-15 22:28:21,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.3010752688172043) internal successors, (121), 111 states have internal predecessors, (121), 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 22:28:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2023-02-15 22:28:21,965 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 51 [2023-02-15 22:28:21,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:21,965 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2023-02-15 22:28:21,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.0) internal successors, (88), 41 states have internal predecessors, (88), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:28:21,966 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2023-02-15 22:28:21,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:28:21,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:21,966 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 22:28:21,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-02-15 22:28:22,172 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 22:28:22,172 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 22:28:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:22,172 INFO L85 PathProgramCache]: Analyzing trace with hash -396596539, now seen corresponding path program 2 times [2023-02-15 22:28:22,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:22,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343723565] [2023-02-15 22:28:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:22,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:22,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:28:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343723565] [2023-02-15 22:28:23,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343723565] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:23,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34707995] [2023-02-15 22:28:23,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:28:23,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:23,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:23,309 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 22:28:23,311 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 22:28:23,514 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:28:23,514 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:28:23,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 135 conjunts are in the unsatisfiable core [2023-02-15 22:28:23,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:23,544 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 22:28:23,749 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:23,750 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 22:28:23,842 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 22:28:23,848 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 22:28:23,957 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:23,962 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:28:23,963 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 51 treesize of output 37 [2023-02-15 22:28:23,966 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 40 treesize of output 38 [2023-02-15 22:28:24,328 INFO L321 Elim1Store]: treesize reduction 122, result has 19.7 percent of original size [2023-02-15 22:28:24,328 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 100 [2023-02-15 22:28:24,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:24,344 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 22:28:24,344 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 82 treesize of output 59 [2023-02-15 22:28:24,359 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-15 22:28:24,359 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 22:28:25,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:25,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:25,488 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:28:25,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2023-02-15 22:28:25,599 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:25,624 INFO L321 Elim1Store]: treesize reduction 102, result has 15.7 percent of original size [2023-02-15 22:28:25,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 78 treesize of output 57 [2023-02-15 22:28:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:28:25,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:25,769 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-02-15 22:28:25,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-02-15 22:28:28,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [34707995] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:28,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:28,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2023-02-15 22:28:28,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480984745] [2023-02-15 22:28:28,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:28,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-02-15 22:28:28,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:28,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-02-15 22:28:28,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=4158, Unknown=5, NotChecked=0, Total=4422 [2023-02-15 22:28:28,188 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 60 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 53 states have internal predecessors, (86), 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 22:28:34,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:34,715 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2023-02-15 22:28:34,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 22:28:34,715 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 53 states have internal predecessors, (86), 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 51 [2023-02-15 22:28:34,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:34,716 INFO L225 Difference]: With dead ends: 203 [2023-02-15 22:28:34,716 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 22:28:34,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2375 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=871, Invalid=8244, Unknown=5, NotChecked=0, Total=9120 [2023-02-15 22:28:34,718 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 739 mSDsluCounter, 2570 mSDsCounter, 0 mSdLazyCounter, 3396 mSolverCounterSat, 39 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 3437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3396 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:34,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 2638 Invalid, 3437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3396 Invalid, 2 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 22:28:34,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 22:28:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 121. [2023-02-15 22:28:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 114 states have internal predecessors, (125), 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 22:28:34,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2023-02-15 22:28:34,721 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 51 [2023-02-15 22:28:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:34,721 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2023-02-15 22:28:34,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 53 states have internal predecessors, (86), 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 22:28:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2023-02-15 22:28:34,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 22:28:34,722 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:34,722 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 22:28:34,728 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 22:28:34,928 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 22:28:34,928 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 22:28:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash -396596538, now seen corresponding path program 2 times [2023-02-15 22:28:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:34,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147975194] [2023-02-15 22:28:34,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:35,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:35,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:35,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:36,120 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 22:28:36,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:36,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147975194] [2023-02-15 22:28:36,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147975194] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:36,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203971228] [2023-02-15 22:28:36,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:28:36,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:36,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:36,123 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 22:28:36,124 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 22:28:36,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:28:36,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:28:36,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 121 conjunts are in the unsatisfiable core [2023-02-15 22:28:36,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:36,349 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 22:28:36,539 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:28:36,539 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 22:28:36,660 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 22:28:36,664 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 22:28:36,812 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-15 22:28:36,813 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 64 treesize of output 46 [2023-02-15 22:28:36,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-02-15 22:28:37,002 INFO L321 Elim1Store]: treesize reduction 29, result has 12.1 percent of original size [2023-02-15 22:28:37,003 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 46 [2023-02-15 22:28:37,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:37,011 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 19 treesize of output 22 [2023-02-15 22:28:37,015 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 22:28:37,197 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2703 (Array Int Int)) (v_ArrVal_2702 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2702)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2703)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 22:28:37,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:37,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:37,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:37,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:37,218 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-02-15 22:28:37,218 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 1 case distinctions, treesize of input 64 treesize of output 66 [2023-02-15 22:28:37,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:37,236 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 22:28:37,236 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 95 treesize of output 81 [2023-02-15 22:28:37,252 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:28:37,252 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 22:28:37,793 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:37,794 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:28:37,813 INFO L321 Elim1Store]: treesize reduction 106, result has 9.4 percent of original size [2023-02-15 22:28:37,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 111 treesize of output 65 [2023-02-15 22:28:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 15 refuted. 3 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 22:28:37,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:38,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203971228] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:38,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:28:38,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 55 [2023-02-15 22:28:38,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976408150] [2023-02-15 22:28:38,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:28:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-15 22:28:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:28:38,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-15 22:28:38,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3192, Unknown=5, NotChecked=114, Total=3540 [2023-02-15 22:28:38,332 INFO L87 Difference]: Start difference. First operand 121 states and 135 transitions. Second operand has 55 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 48 states have internal predecessors, (83), 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 22:28:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:28:41,009 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2023-02-15 22:28:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 22:28:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 48 states have internal predecessors, (83), 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 51 [2023-02-15 22:28:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:28:41,011 INFO L225 Difference]: With dead ends: 121 [2023-02-15 22:28:41,011 INFO L226 Difference]: Without dead ends: 121 [2023-02-15 22:28:41,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=548, Invalid=5148, Unknown=8, NotChecked=148, Total=5852 [2023-02-15 22:28:41,013 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 285 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 25 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 1818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:28:41,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1524 Invalid, 1818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1688 Invalid, 5 Unknown, 100 Unchecked, 0.8s Time] [2023-02-15 22:28:41,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-15 22:28:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2023-02-15 22:28:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 111 states have internal predecessors, (120), 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 22:28:41,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2023-02-15 22:28:41,020 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 51 [2023-02-15 22:28:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:28:41,020 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2023-02-15 22:28:41,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 48 states have internal predecessors, (83), 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 22:28:41,020 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2023-02-15 22:28:41,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:28:41,024 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:28:41,024 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 22:28:41,030 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 22:28:41,230 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 22:28:41,231 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 22:28:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:28:41,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385560, now seen corresponding path program 1 times [2023-02-15 22:28:41,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:28:41,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886094296] [2023-02-15 22:28:41,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:41,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:28:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:28:42,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:28:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:28:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,480 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 22:28:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:28:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886094296] [2023-02-15 22:28:42,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886094296] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:28:42,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229883346] [2023-02-15 22:28:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:28:42,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:28:42,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:28:42,482 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 22:28:42,484 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 22:28:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:28:42,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-15 22:28:42,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:28:42,711 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 22:28:42,751 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 22:28:42,783 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2891 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_2891))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:28:42,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:42,802 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 22:28:42,811 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 22:28:42,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:42,902 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 22:28:43,096 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 22:28:43,100 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 22:28:43,127 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 22:28:43,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:43,315 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 22:28:43,320 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 6 treesize of output 5 [2023-02-15 22:28:43,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:43,322 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 22:28:43,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:43,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2023-02-15 22:28:43,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:43,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-02-15 22:28:43,776 INFO L321 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2023-02-15 22:28:43,776 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 21 treesize of output 24 [2023-02-15 22:28:43,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:28:43,937 INFO L321 Elim1Store]: treesize reduction 36, result has 42.9 percent of original size [2023-02-15 22:28:43,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 70 [2023-02-15 22:28:44,007 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 28 treesize of output 26 [2023-02-15 22:28:44,053 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 22:28:44,248 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 22:28:44,272 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2023-02-15 22:28:44,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:28:46,442 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2901 (Array Int Int))) (= (select |c_#valid| (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_2901) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-15 22:28:47,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:47,299 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2584 treesize of output 2524 [2023-02-15 22:28:47,599 INFO L321 Elim1Store]: treesize reduction 348, result has 57.4 percent of original size [2023-02-15 22:28:47,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 4098 treesize of output 3830 [2023-02-15 22:28:47,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:28:47,720 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 3072 treesize of output 2930 [2023-02-15 22:28:47,829 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 2290 treesize of output 2174 [2023-02-15 22:29:24,530 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 22:29:24,542 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 22:29:24,695 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 33 treesize of output 29 [2023-02-15 22:29:24,709 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 11 treesize of output 7 [2023-02-15 22:29:24,714 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 13 treesize of output 9 [2023-02-15 22:29:24,724 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 13 treesize of output 9 [2023-02-15 22:29:24,742 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 11 treesize of output 7 [2023-02-15 22:29:24,751 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 13 treesize of output 9 [2023-02-15 22:29:24,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:29:24,804 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 183 treesize of output 171 [2023-02-15 22:29:36,592 WARN L233 SmtUtils]: Spent 10.94s on a formula simplification. DAG size of input: 121 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:29:36,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229883346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:36,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:36,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27] total 57 [2023-02-15 22:29:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540614542] [2023-02-15 22:29:36,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:36,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-15 22:29:36,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:36,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-15 22:29:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=4009, Unknown=49, NotChecked=258, Total=4556 [2023-02-15 22:29:36,595 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 58 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 50 states have internal predecessors, (97), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:41,665 INFO L93 Difference]: Finished difference Result 207 states and 224 transitions. [2023-02-15 22:29:41,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 22:29:41,666 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 50 states have internal predecessors, (97), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 56 [2023-02-15 22:29:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:41,669 INFO L225 Difference]: With dead ends: 207 [2023-02-15 22:29:41,669 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 22:29:41,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 108 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2184 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=1103, Invalid=10410, Unknown=51, NotChecked=426, Total=11990 [2023-02-15 22:29:41,672 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1293 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2487 mSolverCounterSat, 51 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 2692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2487 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:41,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1122 Invalid, 2692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2487 Invalid, 2 Unknown, 152 Unchecked, 1.6s Time] [2023-02-15 22:29:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 22:29:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 119. [2023-02-15 22:29:41,684 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 22:29:41,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2023-02-15 22:29:41,685 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 56 [2023-02-15 22:29:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:41,685 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2023-02-15 22:29:41,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.7962962962962963) internal successors, (97), 50 states have internal predecessors, (97), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 22:29:41,686 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2023-02-15 22:29:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:29:41,686 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:41,686 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 22:29:41,692 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 22:29:41,892 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 22:29:41,892 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 22:29:41,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:41,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1874385561, now seen corresponding path program 1 times [2023-02-15 22:29:41,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:41,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945494135] [2023-02-15 22:29:41,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:41,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:42,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:29:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:43,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:29:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:43,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:29:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:43,697 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 22:29:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945494135] [2023-02-15 22:29:43,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945494135] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:43,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397398853] [2023-02-15 22:29:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:43,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:43,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:43,713 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 22:29:43,716 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 22:29:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:43,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 97 conjunts are in the unsatisfiable core [2023-02-15 22:29:43,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:43,977 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 22:29:44,407 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 22:29:44,409 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 22:29:44,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:44,796 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 22:29:44,809 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:29:44,810 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 26 [2023-02-15 22:29:44,823 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:44,823 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 22:29:44,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:44,830 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 22:29:45,254 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 22:29:45,255 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 29 treesize of output 32 [2023-02-15 22:29:45,266 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 22:29:45,267 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 19 treesize of output 18 [2023-02-15 22:29:45,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:45,451 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:29:45,451 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 57 treesize of output 62 [2023-02-15 22:29:45,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:45,472 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:29:45,472 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 62 treesize of output 71 [2023-02-15 22:29:45,500 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 22:29:45,525 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 22:29:45,530 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 22:29:46,057 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 69 treesize of output 45 [2023-02-15 22:29:46,076 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 22:29:46,338 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-15 22:29:46,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:29:46,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397398853] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:46,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:29:46,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [32] total 53 [2023-02-15 22:29:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795155371] [2023-02-15 22:29:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:46,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 22:29:46,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:46,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 22:29:46,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2689, Unknown=1, NotChecked=0, Total=2862 [2023-02-15 22:29:46,341 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 23 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:29:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:47,838 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2023-02-15 22:29:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 22:29:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2023-02-15 22:29:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:47,839 INFO L225 Difference]: With dead ends: 124 [2023-02-15 22:29:47,839 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 22:29:47,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 668 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=276, Invalid=4013, Unknown=1, NotChecked=0, Total=4290 [2023-02-15 22:29:47,840 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 151 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:47,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 649 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 848 Invalid, 2 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:29:47,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 22:29:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 111. [2023-02-15 22:29:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.313953488372093) internal successors, (113), 104 states have internal predecessors, (113), 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 22:29:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2023-02-15 22:29:47,846 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 56 [2023-02-15 22:29:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:47,846 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2023-02-15 22:29:47,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.2857142857142856) internal successors, (48), 20 states have internal predecessors, (48), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 22:29:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2023-02-15 22:29:47,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:29:47,847 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:47,847 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 22:29:47,853 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 22:29:48,053 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 22:29:48,053 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 22:29:48,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1773529958, now seen corresponding path program 3 times [2023-02-15 22:29:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:48,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905201353] [2023-02-15 22:29:48,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:29:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:29:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-02-15 22:29:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-15 22:29:48,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:48,133 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 22:29:48,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905201353] [2023-02-15 22:29:48,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905201353] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:48,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9632773] [2023-02-15 22:29:48,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 22:29:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:48,136 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 22:29:48,161 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 22:29:48,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-02-15 22:29:48,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:29:48,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:29:48,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:48,546 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 22:29:48,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:29:48,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9632773] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:29:48,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:29:48,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 22:29:48,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735490354] [2023-02-15 22:29:48,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:29:48,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:29:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:48,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:29:48,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:29:48,548 INFO L87 Difference]: Start difference. First operand 111 states and 123 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 22:29:48,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:48,556 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2023-02-15 22:29:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:29:48,557 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 22:29:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:48,557 INFO L225 Difference]: With dead ends: 83 [2023-02-15 22:29:48,557 INFO L226 Difference]: Without dead ends: 83 [2023-02-15 22:29:48,558 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 22:29:48,558 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 64 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:48,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 103 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:29:48,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-02-15 22:29:48,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-02-15 22:29:48,562 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 22:29:48,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-15 22:29:48,562 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2023-02-15 22:29:48,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:48,562 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-15 22:29:48,562 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 22:29:48,563 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-15 22:29:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:29:48,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:48,563 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 22:29:48,581 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 22:29:48,763 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 22:29:48,764 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 22:29:48,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1693228283, now seen corresponding path program 1 times [2023-02-15 22:29:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:48,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191095192] [2023-02-15 22:29:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:50,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:29:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:29:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:50,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:29:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:50,743 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 22:29:50,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:50,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191095192] [2023-02-15 22:29:50,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191095192] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:50,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61223706] [2023-02-15 22:29:50,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:50,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:50,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:50,745 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 22:29:50,749 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 22:29:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:50,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 137 conjunts are in the unsatisfiable core [2023-02-15 22:29:50,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:51,044 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 22:29:51,242 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 22:29:51,319 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 22:29:51,418 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:51,419 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 22:29:51,538 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 19 treesize of output 18 [2023-02-15 22:29:51,549 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 22:29:51,700 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:29:51,700 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 38 treesize of output 37 [2023-02-15 22:29:51,705 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 22:29:51,929 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:51,929 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 29 [2023-02-15 22:29:51,933 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 22:29:52,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:52,238 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-15 22:29:52,238 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 58 treesize of output 47 [2023-02-15 22:29:52,246 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:29:52,246 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 22:29:52,251 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 22:29:52,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:52,263 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 22:29:52,995 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:29:52,995 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 103 treesize of output 84 [2023-02-15 22:29:53,017 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:29:53,017 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 44 treesize of output 45 [2023-02-15 22:29:53,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:53,023 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 22:29:53,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:53,113 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:29:53,114 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 55 treesize of output 51 [2023-02-15 22:29:53,121 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 22:29:53,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:29:53,126 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 22:29:53,204 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:53,204 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 48 treesize of output 27 [2023-02-15 22:29:53,208 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 22:29:53,294 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 22:29:53,332 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:29:53,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:29:53,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3510) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3508) |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_3509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:29:53,478 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3510) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3507) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3508) |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_3506) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:29:53,709 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (v_ArrVal_3507 (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|))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_3505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3510) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3507) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3508) |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_3506) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:29:53,728 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (= (let ((.cse0 (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 (select (store (store |c_#memory_int| .cse0 v_ArrVal_3505) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3510) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3507) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3508) |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_3506) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:29:53,953 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (= (let ((.cse0 (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 (select (store (store |c_#memory_int| .cse0 v_ArrVal_3505) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3510) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3507) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3508) |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_3506) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:29:54,006 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3508 (Array Int Int)) (v_ArrVal_3509 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| Int) (v_ArrVal_3520 (Array Int Int)) (v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3510 (Array Int Int)) (v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3505 (Array Int Int)) (v_ArrVal_3506 (Array Int Int)) (v_ArrVal_3507 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| |c_#StackHeapBarrier|)) (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3522)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3521))) (let ((.cse0 (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 .cse2 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3520) .cse0 v_ArrVal_3505) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3510) (select (select (store (store .cse1 .cse0 v_ArrVal_3507) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3508) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store .cse2 .cse0 v_ArrVal_3506) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32| v_ArrVal_3509) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_32|))))) is different from false [2023-02-15 22:29:54,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61223706] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:54,008 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:29:54,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 61 [2023-02-15 22:29:54,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638741804] [2023-02-15 22:29:54,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:29:54,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-02-15 22:29:54,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:29:54,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-02-15 22:29:54,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=3970, Unknown=99, NotChecked=798, Total=5112 [2023-02-15 22:29:54,009 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 61 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 52 states have internal predecessors, (95), 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 22:29:56,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:29:56,884 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2023-02-15 22:29:56,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-15 22:29:56,884 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 52 states have internal predecessors, (95), 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 58 [2023-02-15 22:29:56,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:29:56,885 INFO L225 Difference]: With dead ends: 102 [2023-02-15 22:29:56,885 INFO L226 Difference]: Without dead ends: 102 [2023-02-15 22:29:56,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1549 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=595, Invalid=7326, Unknown=113, NotChecked=1086, Total=9120 [2023-02-15 22:29:56,886 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 444 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 2041 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:29:56,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1131 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2041 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 22:29:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-02-15 22:29:56,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2023-02-15 22:29:56,888 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 22:29:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-02-15 22:29:56,888 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 58 [2023-02-15 22:29:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:29:56,888 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-02-15 22:29:56,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 52 states have internal predecessors, (95), 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 22:29:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-02-15 22:29:56,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:29:56,889 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:29:56,889 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 22:29:56,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-02-15 22:29:57,099 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 22:29:57,100 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 22:29:57,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:29:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478905, now seen corresponding path program 1 times [2023-02-15 22:29:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:29:57,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209592810] [2023-02-15 22:29:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:29:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:29:58,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:29:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:29:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:59,018 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 22:29:59,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:29:59,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209592810] [2023-02-15 22:29:59,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209592810] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:29:59,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035678167] [2023-02-15 22:29:59,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:29:59,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:29:59,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:29:59,021 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 22:29:59,022 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 22:29:59,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:29:59,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-15 22:29:59,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:29:59,330 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 22:29:59,560 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 22:29:59,686 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:29:59,686 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 22:29:59,820 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 22:29:59,986 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:29:59,986 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 26 treesize of output 27 [2023-02-15 22:30:00,219 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:00,219 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 37 treesize of output 20 [2023-02-15 22:30:00,223 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 22:30:00,227 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 22:30:00,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:00,604 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:00,604 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 22:30:00,615 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:30:00,616 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 22:30:00,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:00,631 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 22:30:01,542 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 22:30:01,542 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 6 new quantified variables, introduced 9 case distinctions, treesize of input 91 treesize of output 82 [2023-02-15 22:30:01,557 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:01,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 44 [2023-02-15 22:30:01,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,771 INFO L321 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2023-02-15 22:30:01,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 46 [2023-02-15 22:30:01,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:01,780 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 22:30:01,926 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 22:30:02,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:02,274 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 22:30:02,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 37 [2023-02-15 22:30:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:30:02,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:03,022 INFO L321 Elim1Store]: treesize reduction 43, result has 77.9 percent of original size [2023-02-15 22:30:03,023 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 103 treesize of output 163 [2023-02-15 22:30:03,032 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3709 (Array Int Int)) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3709))) (store .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select .cse2 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_3710) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| .cse0) (= .cse1 .cse0)))))) is different from false [2023-02-15 22:30:03,042 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3709 (Array Int Int)) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3709))) (store .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse3 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse3 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse2 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_3710) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| .cse1)))))) is different from false [2023-02-15 22:30:03,053 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3709 (Array Int Int)) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (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 ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3709))) (store .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse3 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3710) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (= .cse2 .cse1))))))) is different from false [2023-02-15 22:30:03,085 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3709 (Array Int Int)) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (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 ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3709))) (store .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse3 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3710) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (= .cse2 .cse1))))))) is different from false [2023-02-15 22:30:03,097 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3709 (Array Int Int)) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (let ((.cse0 (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 ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3709))) (store .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.offset| (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse3 .cse2) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3710) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (= .cse2 .cse1))))))) is different from false [2023-02-15 22:30:03,123 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3709 (Array Int Int)) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (let ((.cse0 (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 ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3709))) (store .cse4 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.offset| (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse3 .cse2) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3710) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (= .cse0 .cse1) (= .cse2 .cse1))))))) is different from false [2023-02-15 22:30:03,203 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3709 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| Int) (v_ArrVal_3720 (Array Int Int)) (v_ArrVal_3721 (Array Int Int)) (v_ArrVal_3710 (Array Int Int)) (v_ArrVal_3712 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3721)) (.cse4 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3720))) (let ((.cse0 (select (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse3 (let ((.cse5 (store .cse6 .cse0 v_ArrVal_3709))) (store .cse5 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| (store (select .cse5 |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35|) 0 (select (select .cse5 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select .cse3 .cse2) (select (select (store (store .cse4 .cse0 v_ArrVal_3710) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| v_ArrVal_3712) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (or (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_35|))) (= .cse0 .cse1) (= .cse2 .cse1)))))))) is different from false [2023-02-15 22:30:03,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035678167] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:03,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:03,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 35] total 71 [2023-02-15 22:30:03,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422724097] [2023-02-15 22:30:03,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:03,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-15 22:30:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:03,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-15 22:30:03,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=5762, Unknown=10, NotChecked=1106, Total=7140 [2023-02-15 22:30:03,208 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 72 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 63 states have internal predecessors, (110), 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 22:30:08,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:08,390 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2023-02-15 22:30:08,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 22:30:08,390 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 63 states have internal predecessors, (110), 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 22:30:08,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:08,391 INFO L225 Difference]: With dead ends: 134 [2023-02-15 22:30:08,391 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 22:30:08,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 115 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2290 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=759, Invalid=11247, Unknown=12, NotChecked=1554, Total=13572 [2023-02-15 22:30:08,392 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 967 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:08,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 1233 Invalid, 2743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2716 Invalid, 2 Unknown, 0 Unchecked, 1.6s Time] [2023-02-15 22:30:08,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 22:30:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 87. [2023-02-15 22:30:08,394 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 22:30:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-02-15 22:30:08,394 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 62 [2023-02-15 22:30:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:08,395 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-02-15 22:30:08,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 67 states have (on average 1.6417910447761195) internal successors, (110), 63 states have internal predecessors, (110), 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 22:30:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-02-15 22:30:08,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-02-15 22:30:08,395 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:08,395 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 22:30:08,402 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 22:30:08,602 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 22:30:08,602 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 47 more)] === [2023-02-15 22:30:08,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:08,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1290478904, now seen corresponding path program 1 times [2023-02-15 22:30:08,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:08,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059012836] [2023-02-15 22:30:08,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:08,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:10,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:30:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:30:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:11,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:30:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:11,840 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 22:30:11,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:11,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059012836] [2023-02-15 22:30:11,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059012836] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:11,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350888635] [2023-02-15 22:30:11,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:11,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:11,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:11,842 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 22:30:11,844 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 22:30:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:12,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 187 conjunts are in the unsatisfiable core [2023-02-15 22:30:12,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:12,133 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 22:30:12,197 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 22:30:12,242 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 22:30:12,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:12,419 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 22:30:12,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:12,591 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 22:30:12,593 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 22:30:12,820 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:12,820 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 22:30:12,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:12,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:12,832 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 22:30:13,020 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 22:30:13,036 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 22:30:13,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:13,276 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 54 treesize of output 49 [2023-02-15 22:30:13,282 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 22:30:13,678 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:30:13,678 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 81 treesize of output 36 [2023-02-15 22:30:13,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:13,684 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 22:30:13,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:13,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2023-02-15 22:30:13,691 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 22:30:14,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:14,164 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:14,164 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 91 treesize of output 73 [2023-02-15 22:30:14,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:14,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:14,180 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 22:30:14,180 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 25 treesize of output 38 [2023-02-15 22:30:14,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:14,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:14,204 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 22:30:14,205 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 22:30:14,225 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:30:14,226 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 22:30:15,625 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:15,650 INFO L321 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2023-02-15 22:30:15,650 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 177 treesize of output 102 [2023-02-15 22:30:15,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:15,677 INFO L321 Elim1Store]: treesize reduction 112, result has 16.4 percent of original size [2023-02-15 22:30:15,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 167 treesize of output 121 [2023-02-15 22:30:16,022 INFO L321 Elim1Store]: treesize reduction 96, result has 18.6 percent of original size [2023-02-15 22:30:16,022 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 225 treesize of output 106 [2023-02-15 22:30:16,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:16,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:16,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:16,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:16,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 68 [2023-02-15 22:30:17,049 INFO L321 Elim1Store]: treesize reduction 69, result has 14.8 percent of original size [2023-02-15 22:30:17,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 181 treesize of output 89 [2023-02-15 22:30:17,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:17,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:17,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:17,066 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:30:17,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 25 [2023-02-15 22:30:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:30:17,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:31,738 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:30:31,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [350888635] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:31,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:31,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 36] total 77 [2023-02-15 22:30:31,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185922812] [2023-02-15 22:30:31,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:31,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-02-15 22:30:31,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:31,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-02-15 22:30:31,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=8598, Unknown=5, NotChecked=0, Total=8930 [2023-02-15 22:30:31,741 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 78 states, 73 states have (on average 1.5205479452054795) internal successors, (111), 68 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 22:30:43,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:30:43,493 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2023-02-15 22:30:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 22:30:43,493 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 73 states have (on average 1.5205479452054795) internal successors, (111), 68 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 22:30:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:30:43,494 INFO L225 Difference]: With dead ends: 110 [2023-02-15 22:30:43,494 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 22:30:43,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2790 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=1077, Invalid=15428, Unknown=7, NotChecked=0, Total=16512 [2023-02-15 22:30:43,495 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 897 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 3421 mSolverCounterSat, 36 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 3421 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:30:43,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 1414 Invalid, 3459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 3421 Invalid, 2 Unknown, 0 Unchecked, 2.7s Time] [2023-02-15 22:30:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 22:30:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 89. [2023-02-15 22:30:43,497 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 22:30:43,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 22:30:43,497 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 62 [2023-02-15 22:30:43,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:30:43,497 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 22:30:43,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 73 states have (on average 1.5205479452054795) internal successors, (111), 68 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 22:30:43,498 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 22:30:43,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 22:30:43,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:30:43,498 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 22:30:43,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-15 22:30:43,698 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 22:30:43,698 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 22:30:43,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:30:43,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1095322986, now seen corresponding path program 1 times [2023-02-15 22:30:43,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:30:43,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483627140] [2023-02-15 22:30:43,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:43,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:30:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:47,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:30:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:47,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:30:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:47,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:30:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:30:48,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:30:48,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483627140] [2023-02-15 22:30:48,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483627140] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:48,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396221954] [2023-02-15 22:30:48,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:30:48,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:30:48,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:30:48,277 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 22:30:48,279 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 22:30:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:30:48,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 175 conjunts are in the unsatisfiable core [2023-02-15 22:30:48,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:30:48,617 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 22:30:48,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:30:49,023 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 22:30:49,026 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 22:30:49,422 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:49,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:30:49,426 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 22:30:49,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:30:49,612 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 22:30:49,621 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 22:30:49,838 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:30:49,839 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 75 treesize of output 66 [2023-02-15 22:30:49,843 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 26 [2023-02-15 22:30:49,848 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 22:30:50,162 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:30:50,163 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 76 treesize of output 39 [2023-02-15 22:30:50,167 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 22:30:50,170 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 22:30:50,173 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 22:30:50,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:50,639 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:50,639 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 84 treesize of output 68 [2023-02-15 22:30:50,651 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 22:30:50,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2023-02-15 22:30:50,657 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 22:30:50,683 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:30:50,683 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 22:30:50,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:50,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:50,699 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 22:30:51,903 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 22:30:51,903 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 162 treesize of output 123 [2023-02-15 22:30:51,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:51,926 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:30:51,927 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 87 treesize of output 81 [2023-02-15 22:30:51,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:30:51,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:51,934 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 51 treesize of output 38 [2023-02-15 22:30:52,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:52,106 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 22:30:52,107 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 82 treesize of output 66 [2023-02-15 22:30:52,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:30:52,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:52,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:30:52,121 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 22:30:52,526 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-15 22:30:52,526 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 86 treesize of output 48 [2023-02-15 22:30:52,813 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:30:52,813 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 22:30:52,901 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 22:30:52,977 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 22:30:52,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:30:53,672 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4139)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4138))) (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_4136)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4137) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-15 22:30:53,704 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (or (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4139)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base| v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4138))) (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_#t~mem14#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.base|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4137) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| |c_ULTIMATE.start_sll_circular_append_#t~mem14#1.offset|)))) is different from false [2023-02-15 22:30:53,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (or (= (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|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4139)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4138))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4137) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) |c_ULTIMATE.start_main_~data~0#1|) (< (select (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|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30|))) is different from false [2023-02-15 22:30:53,778 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (or (= (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|))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4139)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4138))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4137) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) |c_ULTIMATE.start_main_~data~0#1|) (< (select (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|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30|))) is different from false [2023-02-15 22:30:53,804 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (or (= (let ((.cse0 (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 ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4139)) (.cse1 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4138))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4137) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4))))) |c_ULTIMATE.start_main_~data~0#1|) (< (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset|) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30|))) is different from false [2023-02-15 22:30:53,833 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30|) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4139)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4138))) (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 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4137) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-15 22:30:53,863 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4135 (Array Int Int)) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30|) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4139)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4138))) (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 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_4137) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-15 22:30:53,876 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4137 (Array Int Int)) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (< (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30|) (= (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4135) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4139)) (.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4133) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4138))) (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 (store |c_#memory_int| .cse2 (store (select |c_#memory_int| .cse2) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136)) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_4137) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 4))))) |c_ULTIMATE.start_main_~data~0#1|)))) is different from false [2023-02-15 22:30:53,956 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4133 (Array Int Int)) (v_ArrVal_4135 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| Int) (v_ArrVal_4137 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| Int) (v_ArrVal_4138 (Array Int Int)) (v_ArrVal_4149 (Array Int Int)) (v_ArrVal_4136 Int) (v_ArrVal_4139 (Array Int Int)) (v_ArrVal_4150 (Array Int Int)) (v_ArrVal_4151 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| v_ArrVal_4150)) (.cse6 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| v_ArrVal_4151))) (let ((.cse8 (select (select .cse6 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)) (.cse9 (select (select .cse7 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= (let ((.cse1 (select (select .cse6 .cse8) .cse9))) (let ((.cse5 (store (store .cse7 .cse1 v_ArrVal_4135) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| v_ArrVal_4139)) (.cse2 (store (store .cse6 .cse1 v_ArrVal_4133) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| v_ArrVal_4138))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |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_41| v_ArrVal_4149))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30| v_ArrVal_4136))) |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| v_ArrVal_4137) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 4))))) |c_ULTIMATE.start_main_~data~0#1|) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41|))) (not (< |v_ULTIMATE.start_sll_circular_append_#t~ret9#1.base_41| |c_#StackHeapBarrier|)) (< (select (select .cse7 .cse8) .cse9) |v_ULTIMATE.start_sll_circular_append_~last~1#1.offset_30|))))) is different from false [2023-02-15 22:30:53,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396221954] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:30:53,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:30:53,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 38] total 78 [2023-02-15 22:30:53,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687990265] [2023-02-15 22:30:53,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:30:53,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2023-02-15 22:30:53,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:30:53,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2023-02-15 22:30:53,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=6649, Unknown=80, NotChecked=1548, Total=8556 [2023-02-15 22:30:53,961 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 78 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 69 states have internal predecessors, (114), 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 22:31:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:01,633 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2023-02-15 22:31:01,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 22:31:01,633 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 69 states have internal predecessors, (114), 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 64 [2023-02-15 22:31:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:01,634 INFO L225 Difference]: With dead ends: 108 [2023-02-15 22:31:01,634 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 22:31:01,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 122 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2239 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=740, Invalid=12314, Unknown=92, NotChecked=2106, Total=15252 [2023-02-15 22:31:01,635 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 461 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 3306 mSolverCounterSat, 25 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 3333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3306 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:01,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1429 Invalid, 3333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3306 Invalid, 2 Unknown, 0 Unchecked, 2.3s Time] [2023-02-15 22:31:01,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 22:31:01,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-02-15 22:31:01,638 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 22:31:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-02-15 22:31:01,638 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 64 [2023-02-15 22:31:01,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:01,639 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-02-15 22:31:01,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 69 states have internal predecessors, (114), 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 22:31:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-02-15 22:31:01,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 22:31:01,639 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:01,640 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 22:31:01,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-02-15 22:31:01,849 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 22:31:01,849 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 22:31:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826698, now seen corresponding path program 2 times [2023-02-15 22:31:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:01,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917065914] [2023-02-15 22:31:01,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:03,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:31:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:03,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:31:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:04,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:31:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:04,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:31:04,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917065914] [2023-02-15 22:31:04,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917065914] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:04,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744953960] [2023-02-15 22:31:04,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:31:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:04,653 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 22:31:04,655 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 22:31:04,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:31:04,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:31:04,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 202 conjunts are in the unsatisfiable core [2023-02-15 22:31:04,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:05,032 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 22:31:05,253 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 22:31:05,467 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:31:05,467 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 22:31:05,673 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 22:31:05,678 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 22:31:05,903 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:05,910 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:31:05,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 42 [2023-02-15 22:31:05,918 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 40 treesize of output 38 [2023-02-15 22:31:06,267 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2023-02-15 22:31:06,268 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 6 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 53 [2023-02-15 22:31:06,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:06,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2023-02-15 22:31:06,278 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 22:31:06,340 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 22:31:06,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:06,780 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2023-02-15 22:31:06,780 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 116 treesize of output 98 [2023-02-15 22:31:06,796 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 22:31:06,797 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 22:31:06,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:06,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:06,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:06,811 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 71 treesize of output 61 [2023-02-15 22:31:08,942 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:08,973 INFO L321 Elim1Store]: treesize reduction 183, result has 10.7 percent of original size [2023-02-15 22:31:08,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 14 case distinctions, treesize of input 246 treesize of output 141 [2023-02-15 22:31:08,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:08,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:09,011 INFO L321 Elim1Store]: treesize reduction 184, result has 16.7 percent of original size [2023-02-15 22:31:09,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 203 treesize of output 132 [2023-02-15 22:31:09,391 INFO L321 Elim1Store]: treesize reduction 88, result has 20.0 percent of original size [2023-02-15 22:31:09,392 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 349 treesize of output 130 [2023-02-15 22:31:09,396 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:09,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:09,421 INFO L321 Elim1Store]: treesize reduction 156, result has 17.9 percent of original size [2023-02-15 22:31:09,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 301 treesize of output 192 [2023-02-15 22:31:10,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:10,478 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 33 treesize of output 9 [2023-02-15 22:31:11,068 INFO L321 Elim1Store]: treesize reduction 145, result has 9.4 percent of original size [2023-02-15 22:31:11,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 12 new quantified variables, introduced 15 case distinctions, treesize of input 248 treesize of output 116 [2023-02-15 22:31:11,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:11,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:11,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:11,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2023-02-15 22:31:11,177 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 22:31:11,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:31:13,760 INFO L321 Elim1Store]: treesize reduction 191, result has 89.8 percent of original size [2023-02-15 22:31:13,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 632 treesize of output 1697 [2023-02-15 22:31:15,326 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 5505 treesize of output 4426 [2023-02-15 22:31:15,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744953960] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:15,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:31:15,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42] total 79 [2023-02-15 22:31:15,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013104130] [2023-02-15 22:31:15,766 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:31:15,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-02-15 22:31:15,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:31:15,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-02-15 22:31:15,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=520, Invalid=9580, Unknown=0, NotChecked=0, Total=10100 [2023-02-15 22:31:15,768 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 80 states, 75 states have (on average 1.6) internal successors, (120), 71 states have internal predecessors, (120), 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 22:31:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:31:31,591 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2023-02-15 22:31:31,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-02-15 22:31:31,591 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 75 states have (on average 1.6) internal successors, (120), 71 states have internal predecessors, (120), 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 68 [2023-02-15 22:31:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:31:31,592 INFO L225 Difference]: With dead ends: 216 [2023-02-15 22:31:31,592 INFO L226 Difference]: Without dead ends: 216 [2023-02-15 22:31:31,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3787 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=1775, Invalid=18247, Unknown=0, NotChecked=0, Total=20022 [2023-02-15 22:31:31,594 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2302 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 3807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:31:31,594 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 1435 Invalid, 3807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-02-15 22:31:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-15 22:31:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 105. [2023-02-15 22:31:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 100 states have internal predecessors, (114), 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 22:31:31,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2023-02-15 22:31:31,596 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 68 [2023-02-15 22:31:31,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:31:31,597 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2023-02-15 22:31:31,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 75 states have (on average 1.6) internal successors, (120), 71 states have internal predecessors, (120), 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 22:31:31,597 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2023-02-15 22:31:31,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 22:31:31,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:31:31,597 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 22:31:31,610 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 22:31:31,797 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 22:31:31,798 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 22:31:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:31:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1212826697, now seen corresponding path program 2 times [2023-02-15 22:31:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:31:31,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352277890] [2023-02-15 22:31:31,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:31:31,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:31:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:33,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:31:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:33,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-15 22:31:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:33,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-15 22:31:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:31:34,138 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 22:31:34,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:31:34,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352277890] [2023-02-15 22:31:34,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352277890] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:31:34,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615666563] [2023-02-15 22:31:34,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:31:34,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:31:34,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:31:34,140 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 22:31:34,142 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 22:31:34,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:31:34,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:31:34,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 152 conjunts are in the unsatisfiable core [2023-02-15 22:31:34,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:31:34,836 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 22:31:34,838 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 22:31:34,885 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 22:31:35,187 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:31:35,187 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 22:31:36,263 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:36,284 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2023-02-15 22:31:36,285 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 22:31:36,304 INFO L321 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2023-02-15 22:31:36,304 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 22:31:36,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:36,687 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:31:36,810 INFO L321 Elim1Store]: treesize reduction 160, result has 48.9 percent of original size [2023-02-15 22:31:36,810 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 9 new quantified variables, introduced 14 case distinctions, treesize of input 153 treesize of output 244 [2023-02-15 22:31:36,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:31:36,862 INFO L321 Elim1Store]: treesize reduction 140, result has 26.3 percent of original size [2023-02-15 22:31:36,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 316 treesize of output 218 [2023-02-15 22:31:44,781 INFO L321 Elim1Store]: treesize reduction 200, result has 75.6 percent of original size [2023-02-15 22:31:44,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 19 new quantified variables, introduced 55 case distinctions, treesize of input 455 treesize of output 923 [2023-02-15 22:31:45,736 INFO L321 Elim1Store]: treesize reduction 180, result has 77.2 percent of original size [2023-02-15 22:31:45,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 19 new quantified variables, introduced 66 case distinctions, treesize of input 964 treesize of output 1189