./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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/heap-manipulation/sll_to_dll_rev-2.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 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:22:18,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:22:18,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:22:18,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:22:18,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:22:18,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:22:18,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:22:18,513 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:22:18,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:22:18,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:22:18,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:22:18,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:22:18,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:22:18,522 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:22:18,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:22:18,524 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:22:18,524 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:22:18,525 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:22:18,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:22:18,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:22:18,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:22:18,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:22:18,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:22:18,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:22:18,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:22:18,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:22:18,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:22:18,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:22:18,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:22:18,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:22:18,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:22:18,541 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:22:18,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:22:18,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:22:18,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:22:18,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:22:18,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:22:18,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:22:18,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:22:18,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:22:18,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:22:18,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:22:18,568 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:22:18,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:22:18,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:22:18,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:22:18,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:22:18,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:22:18,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:22:18,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:22:18,570 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:22:18,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:22:18,571 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:22:18,571 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:22:18,572 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:22:18,573 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:22:18,573 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:22:18,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:22:18,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:22:18,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:22:18,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:22:18,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:22:18,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:22:18,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:22:18,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:22:18,574 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:22:18,574 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:22:18,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:22:18,574 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:22:18,575 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 -> 8f9453cad2383b5119b308e041fed5f4a740e7abd43cb8ad7833872af20a8d57 [2023-02-15 01:22:18,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:22:18,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:22:18,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:22:18,813 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:22:18,813 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:22:18,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2023-02-15 01:22:19,794 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:22:20,086 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:22:20,087 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2023-02-15 01:22:20,095 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c198661/f28fda71f60e4b039f59b260e4013196/FLAG28407d2f7 [2023-02-15 01:22:20,108 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c198661/f28fda71f60e4b039f59b260e4013196 [2023-02-15 01:22:20,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:22:20,112 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:22:20,113 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:22:20,113 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:22:20,116 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:22:20,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,117 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308f7b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20, skipping insertion in model container [2023-02-15 01:22:20,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:22:20,158 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:22:20,354 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/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2023-02-15 01:22:20,388 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:22:20,397 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:22:20,429 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/heap-manipulation/sll_to_dll_rev-2.i[22636,22649] [2023-02-15 01:22:20,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:22:20,475 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:22:20,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20 WrapperNode [2023-02-15 01:22:20,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:22:20,477 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:22:20,477 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:22:20,477 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:22:20,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,506 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,523 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-02-15 01:22:20,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:22:20,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:22:20,526 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:22:20,526 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:22:20,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,572 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,579 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:22:20,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:22:20,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:22:20,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:22:20,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (1/1) ... [2023-02-15 01:22:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:22:20,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:22:20,606 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 01:22:20,613 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 01:22:20,638 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 01:22:20,638 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 01:22:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:22:20,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:22:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:22:20,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:22:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:22:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2023-02-15 01:22:20,643 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2023-02-15 01:22:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:22:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:22:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2023-02-15 01:22:20,643 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2023-02-15 01:22:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 01:22:20,643 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2023-02-15 01:22:20,644 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2023-02-15 01:22:20,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:22:20,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:22:20,727 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:22:20,728 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:22:21,079 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:22:21,085 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:22:21,085 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2023-02-15 01:22:21,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:22:21 BoogieIcfgContainer [2023-02-15 01:22:21,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:22:21,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:22:21,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:22:21,090 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:22:21,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:22:20" (1/3) ... [2023-02-15 01:22:21,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f87313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:22:21, skipping insertion in model container [2023-02-15 01:22:21,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:20" (2/3) ... [2023-02-15 01:22:21,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f87313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:22:21, skipping insertion in model container [2023-02-15 01:22:21,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:22:21" (3/3) ... [2023-02-15 01:22:21,092 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2023-02-15 01:22:21,114 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:22:21,115 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2023-02-15 01:22:21,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:22:21,149 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;@65de8478, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:22:21,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-02-15 01:22:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 223 states, 121 states have (on average 2.090909090909091) internal successors, (253), 209 states have internal predecessors, (253), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-02-15 01:22:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 01:22:21,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:21,157 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 01:22:21,186 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:21,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:21,190 INFO L85 PathProgramCache]: Analyzing trace with hash 6220774, now seen corresponding path program 1 times [2023-02-15 01:22:21,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:21,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942339660] [2023-02-15 01:22:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:21,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:21,342 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 01:22:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:21,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942339660] [2023-02-15 01:22:21,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942339660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:21,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:21,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:22:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473205134] [2023-02-15 01:22:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:21,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:22:21,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:21,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:22:21,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:22:21,379 INFO L87 Difference]: Start difference. First operand has 223 states, 121 states have (on average 2.090909090909091) internal successors, (253), 209 states have internal predecessors, (253), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:21,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:21,416 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2023-02-15 01:22:21,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:22:21,418 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 01:22:21,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:21,426 INFO L225 Difference]: With dead ends: 221 [2023-02-15 01:22:21,427 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 01:22:21,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:22:21,432 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:21,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:22:21,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 01:22:21,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-02-15 01:22:21,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 116 states have (on average 1.8448275862068966) internal successors, (214), 205 states have internal predecessors, (214), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:21,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2023-02-15 01:22:21,488 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 4 [2023-02-15 01:22:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:21,489 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2023-02-15 01:22:21,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2023-02-15 01:22:21,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:22:21,489 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:21,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:22:21,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 01:22:21,490 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting chain_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154958, now seen corresponding path program 1 times [2023-02-15 01:22:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:21,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678843339] [2023-02-15 01:22:21,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:21,622 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 01:22:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:21,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678843339] [2023-02-15 01:22:21,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678843339] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:21,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:21,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:22:21,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437399656] [2023-02-15 01:22:21,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:21,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:22:21,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:21,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:22:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:22:21,627 INFO L87 Difference]: Start difference. First operand 219 states and 240 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 01:22:21,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:21,784 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2023-02-15 01:22:21,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:22:21,784 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 01:22:21,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:21,785 INFO L225 Difference]: With dead ends: 217 [2023-02-15 01:22:21,785 INFO L226 Difference]: Without dead ends: 217 [2023-02-15 01:22:21,786 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 01:22:21,787 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 17 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:21,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 367 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:22:21,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-15 01:22:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-02-15 01:22:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 116 states have (on average 1.8275862068965518) internal successors, (212), 203 states have internal predecessors, (212), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2023-02-15 01:22:21,794 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 6 [2023-02-15 01:22:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:21,794 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2023-02-15 01:22:21,794 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 01:22:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2023-02-15 01:22:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 01:22:21,794 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:21,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 01:22:21,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 01:22:21,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting chain_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:21,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154959, now seen corresponding path program 1 times [2023-02-15 01:22:21,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:21,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787283713] [2023-02-15 01:22:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:21,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:21,872 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 01:22:21,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:21,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787283713] [2023-02-15 01:22:21,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787283713] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:21,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:21,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:22:21,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465772651] [2023-02-15 01:22:21,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:21,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:22:21,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:21,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:22:21,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:22:21,874 INFO L87 Difference]: Start difference. First operand 217 states and 238 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 01:22:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:21,953 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2023-02-15 01:22:21,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:22:21,954 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 01:22:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:21,956 INFO L225 Difference]: With dead ends: 215 [2023-02-15 01:22:21,956 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 01:22:21,959 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 01:22:21,961 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:21,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 372 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:22:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 01:22:21,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-02-15 01:22:21,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 116 states have (on average 1.8103448275862069) internal successors, (210), 201 states have internal predecessors, (210), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:21,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2023-02-15 01:22:21,976 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 6 [2023-02-15 01:22:21,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:21,977 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2023-02-15 01:22:21,977 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 01:22:21,977 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2023-02-15 01:22:21,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 01:22:21,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:21,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:21,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 01:22:21,977 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting chain_nodeErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash -387700622, now seen corresponding path program 1 times [2023-02-15 01:22:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:21,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092451497] [2023-02-15 01:22:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:21,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:22,166 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 01:22:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:22,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092451497] [2023-02-15 01:22:22,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092451497] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:22,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:22,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:22:22,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849724515] [2023-02-15 01:22:22,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:22,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:22:22,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:22,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:22:22,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:22:22,168 INFO L87 Difference]: Start difference. First operand 215 states and 236 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 01:22:22,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:22,344 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2023-02-15 01:22:22,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:22:22,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2023-02-15 01:22:22,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:22,345 INFO L225 Difference]: With dead ends: 210 [2023-02-15 01:22:22,345 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 01:22:22,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:22,346 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 56 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:22,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 606 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:22:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 01:22:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-02-15 01:22:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 116 states have (on average 1.7672413793103448) internal successors, (205), 196 states have internal predecessors, (205), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2023-02-15 01:22:22,352 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 10 [2023-02-15 01:22:22,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:22,352 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2023-02-15 01:22:22,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 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 01:22:22,352 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2023-02-15 01:22:22,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 01:22:22,352 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:22,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:22,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 01:22:22,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting chain_nodeErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash -387700621, now seen corresponding path program 1 times [2023-02-15 01:22:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:22,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609619727] [2023-02-15 01:22:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:22,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:22,541 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 01:22:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:22,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609619727] [2023-02-15 01:22:22,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609619727] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:22,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:22,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:22:22,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812812139] [2023-02-15 01:22:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:22,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:22:22,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:22:22,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:22:22,545 INFO L87 Difference]: Start difference. First operand 210 states and 231 transitions. Second operand has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 01:22:22,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:22,754 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2023-02-15 01:22:22,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:22:22,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2023-02-15 01:22:22,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:22,758 INFO L225 Difference]: With dead ends: 205 [2023-02-15 01:22:22,759 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 01:22:22,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 01:22:22,760 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 39 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:22,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 544 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:22:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 01:22:22,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-02-15 01:22:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 116 states have (on average 1.7241379310344827) internal successors, (200), 191 states have internal predecessors, (200), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2023-02-15 01:22:22,773 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 10 [2023-02-15 01:22:22,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:22,774 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2023-02-15 01:22:22,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 01:22:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2023-02-15 01:22:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:22:22,775 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:22,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:22,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 01:22:22,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting chain_nodeErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:22,777 INFO L85 PathProgramCache]: Analyzing trace with hash 866182740, now seen corresponding path program 1 times [2023-02-15 01:22:22,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:22,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163437184] [2023-02-15 01:22:22,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:22,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:22,835 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 01:22:22,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:22,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163437184] [2023-02-15 01:22:22,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163437184] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:22,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:22,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:22:22,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688505727] [2023-02-15 01:22:22,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:22,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:22:22,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:22,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:22:22,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:22:22,837 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 01:22:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:22,978 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2023-02-15 01:22:22,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:22:22,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2023-02-15 01:22:22,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:22,981 INFO L225 Difference]: With dead ends: 204 [2023-02-15 01:22:22,981 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 01:22:22,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:22,983 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 21 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:22,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 630 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:22:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 01:22:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2023-02-15 01:22:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 116 states have (on average 1.7155172413793103) internal successors, (199), 190 states have internal predecessors, (199), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:22,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2023-02-15 01:22:22,992 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2023-02-15 01:22:22,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:22,992 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2023-02-15 01:22:22,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 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 01:22:22,993 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2023-02-15 01:22:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:22:22,993 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:22,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:22,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 01:22:22,995 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting chain_nodeErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash 866182741, now seen corresponding path program 1 times [2023-02-15 01:22:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:22,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132986338] [2023-02-15 01:22:22,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:22,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:23,088 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 01:22:23,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:23,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132986338] [2023-02-15 01:22:23,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132986338] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:23,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:23,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:22:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083063759] [2023-02-15 01:22:23,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:23,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:22:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:23,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:22:23,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:22:23,090 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 01:22:23,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:23,228 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2023-02-15 01:22:23,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:22:23,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 11 [2023-02-15 01:22:23,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:23,230 INFO L225 Difference]: With dead ends: 203 [2023-02-15 01:22:23,230 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 01:22:23,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:22:23,230 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 19 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:23,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 858 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:22:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 01:22:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-02-15 01:22:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 116 states have (on average 1.706896551724138) internal successors, (198), 189 states have internal predecessors, (198), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2023-02-15 01:22:23,234 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 11 [2023-02-15 01:22:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:23,234 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2023-02-15 01:22:23,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 01:22:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2023-02-15 01:22:23,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:22:23,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:23,234 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:23,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 01:22:23,234 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:23,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash -610249734, now seen corresponding path program 1 times [2023-02-15 01:22:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:23,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478834201] [2023-02-15 01:22:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:23,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:23,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:23,405 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 01:22:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:23,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478834201] [2023-02-15 01:22:23,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478834201] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:23,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:23,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:22:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562667480] [2023-02-15 01:22:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:23,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:22:23,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:22:23,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:23,407 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 01:22:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:23,721 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2023-02-15 01:22:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:22:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2023-02-15 01:22:23,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:23,722 INFO L225 Difference]: With dead ends: 202 [2023-02-15 01:22:23,722 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 01:22:23,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:23,723 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 74 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:23,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 525 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:23,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 01:22:23,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2023-02-15 01:22:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 116 states have (on average 1.6982758620689655) internal successors, (197), 188 states have internal predecessors, (197), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2023-02-15 01:22:23,726 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2023-02-15 01:22:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:23,727 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2023-02-15 01:22:23,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 01:22:23,728 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2023-02-15 01:22:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:22:23,728 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:23,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:23,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 01:22:23,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:23,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:23,729 INFO L85 PathProgramCache]: Analyzing trace with hash -610249733, now seen corresponding path program 1 times [2023-02-15 01:22:23,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:23,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651462913] [2023-02-15 01:22:23,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:23,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:23,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:24,014 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 01:22:24,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:24,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651462913] [2023-02-15 01:22:24,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651462913] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:24,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:24,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:22:24,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337111215] [2023-02-15 01:22:24,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:24,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:22:24,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:24,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:22:24,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:24,016 INFO L87 Difference]: Start difference. First operand 202 states and 223 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 01:22:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:24,337 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2023-02-15 01:22:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:22:24,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2023-02-15 01:22:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:24,339 INFO L225 Difference]: With dead ends: 210 [2023-02-15 01:22:24,339 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 01:22:24,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:24,341 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 59 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:24,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 484 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 01:22:24,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2023-02-15 01:22:24,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 120 states have (on average 1.6833333333333333) internal successors, (202), 192 states have internal predecessors, (202), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 01:22:24,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 230 transitions. [2023-02-15 01:22:24,346 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 230 transitions. Word has length 19 [2023-02-15 01:22:24,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:24,347 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 230 transitions. [2023-02-15 01:22:24,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 01:22:24,347 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 230 transitions. [2023-02-15 01:22:24,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-02-15 01:22:24,348 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:24,348 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:24,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 01:22:24,348 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:24,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:24,349 INFO L85 PathProgramCache]: Analyzing trace with hash 450998278, now seen corresponding path program 1 times [2023-02-15 01:22:24,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:24,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755227811] [2023-02-15 01:22:24,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:24,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:24,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:24,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-02-15 01:22:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 01:22:24,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:24,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755227811] [2023-02-15 01:22:24,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755227811] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:24,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619122790] [2023-02-15 01:22:24,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:24,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:22:24,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:22:24,771 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 01:22:24,817 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 01:22:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:24,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 01:22:24,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:25,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:25,053 INFO L321 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-02-15 01:22:25,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 12 treesize of output 23 [2023-02-15 01:22:25,076 INFO L321 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-02-15 01:22:25,076 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 2 case distinctions, treesize of input 111 treesize of output 117 [2023-02-15 01:22:25,130 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 01:22:25,134 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 01:22:25,190 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_428 Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store |c_old(#length)| |chain_node_~node~0#1.base| v_ArrVal_428) |c_#length|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2023-02-15 01:22:25,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:25,238 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 01:22:25,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:25,244 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 01:22:25,267 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 01:22:25,283 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_429 Int)) (= |c_#length| (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_429))) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:22:25,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:25,363 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 01:22:25,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-02-15 01:22:25,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:22:25,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619122790] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:25,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:22:25,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 13 [2023-02-15 01:22:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399401425] [2023-02-15 01:22:25,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:22:25,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 01:22:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:25,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 01:22:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=140, Unknown=2, NotChecked=50, Total=240 [2023-02-15 01:22:25,470 INFO L87 Difference]: Start difference. First operand 207 states and 230 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:22:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:25,800 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2023-02-15 01:22:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:22:25,801 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2023-02-15 01:22:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:25,802 INFO L225 Difference]: With dead ends: 207 [2023-02-15 01:22:25,802 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 01:22:25,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=162, Unknown=2, NotChecked=54, Total=272 [2023-02-15 01:22:25,802 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 251 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 431 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:25,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 399 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 712 Invalid, 0 Unknown, 431 Unchecked, 0.3s Time] [2023-02-15 01:22:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 01:22:25,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2023-02-15 01:22:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 116 states have (on average 1.6896551724137931) internal successors, (196), 187 states have internal predecessors, (196), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:25,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2023-02-15 01:22:25,806 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 34 [2023-02-15 01:22:25,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:25,806 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2023-02-15 01:22:25,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 11 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:22:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2023-02-15 01:22:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:22:25,807 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:25,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:25,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:26,015 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,SelfDestructingSolverStorable9 [2023-02-15 01:22:26,015 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:26,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 50383991, now seen corresponding path program 1 times [2023-02-15 01:22:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545104745] [2023-02-15 01:22:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:26,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:26,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:22:26,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:26,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545104745] [2023-02-15 01:22:26,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545104745] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:26,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947313627] [2023-02-15 01:22:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:26,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:22:26,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:22:26,376 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 01:22:26,407 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 01:22:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:26,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 01:22:26,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:26,524 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 01:22:26,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 24 [2023-02-15 01:22:26,555 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| 1))) is different from true [2023-02-15 01:22:26,606 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 01:22:26,606 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 3 case distinctions, treesize of input 25 treesize of output 46 [2023-02-15 01:22:26,734 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_625 Int)) (= |c_#valid| (store |c_old(#valid)| |c_chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_625))) is different from true [2023-02-15 01:22:26,741 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_625 Int)) (= |c_#valid| (store |c_old(#valid)| |c_chain_node_alloc_node_#res#1.base| v_ArrVal_625))) is different from true [2023-02-15 01:22:26,744 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_625 Int)) (= |c_#valid| (store |c_old(#valid)| |c_chain_node_~node~0#1.base| v_ArrVal_625))) is different from true [2023-02-15 01:22:26,829 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 01:22:26,830 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 3 case distinctions, treesize of input 21 treesize of output 38 [2023-02-15 01:22:26,875 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2023-02-15 01:22:26,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:22:27,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947313627] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:27,172 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:22:27,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-02-15 01:22:27,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297371490] [2023-02-15 01:22:27,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:22:27,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:22:27,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:27,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:22:27,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=400, Unknown=4, NotChecked=180, Total=702 [2023-02-15 01:22:27,174 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 19 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:22:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:27,779 INFO L93 Difference]: Finished difference Result 202 states and 222 transitions. [2023-02-15 01:22:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:22:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 37 [2023-02-15 01:22:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:27,780 INFO L225 Difference]: With dead ends: 202 [2023-02-15 01:22:27,780 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 01:22:27,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=589, Unknown=4, NotChecked=220, Total=992 [2023-02-15 01:22:27,781 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 198 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 49 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 866 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:27,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 696 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 761 Invalid, 30 Unknown, 866 Unchecked, 0.5s Time] [2023-02-15 01:22:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 01:22:27,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2023-02-15 01:22:27,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 116 states have (on average 1.6810344827586208) internal successors, (195), 186 states have internal predecessors, (195), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:27,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2023-02-15 01:22:27,784 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 37 [2023-02-15 01:22:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:27,784 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2023-02-15 01:22:27,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 17 states have internal predecessors, (64), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:22:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2023-02-15 01:22:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:22:27,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:27,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:27,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:27,990 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,SelfDestructingSolverStorable10 [2023-02-15 01:22:27,990 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:27,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:27,991 INFO L85 PathProgramCache]: Analyzing trace with hash 50383992, now seen corresponding path program 1 times [2023-02-15 01:22:27,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:27,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497927478] [2023-02-15 01:22:27,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:27,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:28,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:22:28,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497927478] [2023-02-15 01:22:28,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497927478] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:28,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186920499] [2023-02-15 01:22:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:28,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:22:28,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:22:28,419 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 01:22:28,419 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 01:22:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:28,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 01:22:28,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:28,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:28,563 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 01:22:28,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 24 [2023-02-15 01:22:28,567 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 10 treesize of output 8 [2023-02-15 01:22:28,602 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 9 treesize of output 7 [2023-02-15 01:22:28,615 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_822 Int)) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_822) |c_#length|)) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:22:28,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:28,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:22:28,693 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 9 treesize of output 7 [2023-02-15 01:22:28,698 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_823 Int)) (= (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_823) |c_#length|)) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 01:22:28,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:28,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:22:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2023-02-15 01:22:28,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:22:30,845 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_sll_~#list~0#1.offset| 4))) (and (forall ((|v_chain_node_alloc_node_~ptr~0#1.base_24| Int)) (or (not (< |v_chain_node_alloc_node_~ptr~0#1.base_24| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_826 Int)) (let ((.cse1 (store |c_#length| |v_chain_node_alloc_node_~ptr~0#1.base_24| v_ArrVal_826))) (or (not (<= .cse0 (select .cse1 |c_ULTIMATE.start_create_sll_~#list~0#1.base|))) (<= (+ |c_ULTIMATE.start_create_sll_~pp1#1.offset| 4) (select .cse1 |c_ULTIMATE.start_create_sll_~pp1#1.base|))))))) (or (<= 0 |c_ULTIMATE.start_create_sll_~pp1#1.offset|) (forall ((|v_chain_node_alloc_node_~ptr~0#1.base_24| Int) (v_ArrVal_826 Int)) (or (not (<= .cse0 (select (store |c_#length| |v_chain_node_alloc_node_~ptr~0#1.base_24| v_ArrVal_826) |c_ULTIMATE.start_create_sll_~#list~0#1.base|))) (not (< |v_chain_node_alloc_node_~ptr~0#1.base_24| |c_#StackHeapBarrier|))))))) is different from false [2023-02-15 01:22:30,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186920499] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:30,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:22:30,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2023-02-15 01:22:30,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366964128] [2023-02-15 01:22:30,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:22:30,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 01:22:30,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:30,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 01:22:30,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=169, Unknown=3, NotChecked=84, Total=306 [2023-02-15 01:22:30,850 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:22:31,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:31,353 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2023-02-15 01:22:31,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:22:31,353 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2023-02-15 01:22:31,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:31,354 INFO L225 Difference]: With dead ends: 199 [2023-02-15 01:22:31,354 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 01:22:31,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=73, Invalid=242, Unknown=3, NotChecked=102, Total=420 [2023-02-15 01:22:31,355 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 558 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 418 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:31,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 571 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 848 Invalid, 0 Unknown, 418 Unchecked, 0.4s Time] [2023-02-15 01:22:31,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 01:22:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-02-15 01:22:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 116 states have (on average 1.6724137931034482) internal successors, (194), 185 states have internal predecessors, (194), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2023-02-15 01:22:31,358 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 37 [2023-02-15 01:22:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:31,358 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2023-02-15 01:22:31,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.571428571428571) internal successors, (64), 13 states have internal predecessors, (64), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 01:22:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2023-02-15 01:22:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:22:31,359 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:31,359 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-02-15 01:22:31,367 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 01:22:31,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:22:31,565 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:31,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:31,565 INFO L85 PathProgramCache]: Analyzing trace with hash 819452048, now seen corresponding path program 1 times [2023-02-15 01:22:31,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:31,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121839839] [2023-02-15 01:22:31,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:31,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:31,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:31,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 01:22:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:31,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 01:22:31,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:31,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121839839] [2023-02-15 01:22:31,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121839839] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:31,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:31,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:22:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392643130] [2023-02-15 01:22:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:31,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:22:31,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:22:31,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:22:31,922 INFO L87 Difference]: Start difference. First operand 199 states and 220 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 01:22:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:32,278 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2023-02-15 01:22:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:22:32,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 58 [2023-02-15 01:22:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:32,279 INFO L225 Difference]: With dead ends: 204 [2023-02-15 01:22:32,279 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 01:22:32,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:22:32,280 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 184 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:32,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 433 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:32,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 01:22:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2023-02-15 01:22:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 116 states have (on average 1.6120689655172413) internal successors, (187), 178 states have internal predecessors, (187), 17 states have call successors, (17), 4 states have call predecessors, (17), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:22:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2023-02-15 01:22:32,283 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 58 [2023-02-15 01:22:32,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:32,283 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2023-02-15 01:22:32,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 01:22:32,283 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2023-02-15 01:22:32,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 01:22:32,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:32,284 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-02-15 01:22:32,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 01:22:32,284 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:32,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash 819452049, now seen corresponding path program 1 times [2023-02-15 01:22:32,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:32,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519271354] [2023-02-15 01:22:32,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:32,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:32,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 01:22:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 01:22:32,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:32,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519271354] [2023-02-15 01:22:32,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519271354] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:32,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:32,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:22:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708228084] [2023-02-15 01:22:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:32,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:22:32,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:22:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:22:32,548 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 01:22:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:32,893 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2023-02-15 01:22:32,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:22:32,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 58 [2023-02-15 01:22:32,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:32,895 INFO L225 Difference]: With dead ends: 215 [2023-02-15 01:22:32,895 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 01:22:32,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:22:32,895 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 415 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:32,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 290 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:32,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 01:22:32,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2023-02-15 01:22:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 123 states have (on average 1.5365853658536586) internal successors, (189), 179 states have internal predecessors, (189), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 01:22:32,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2023-02-15 01:22:32,899 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 58 [2023-02-15 01:22:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:32,899 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2023-02-15 01:22:32,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 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 01:22:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2023-02-15 01:22:32,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:22:32,899 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:32,900 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 01:22:32,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 01:22:32,900 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:32,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash -366790067, now seen corresponding path program 1 times [2023-02-15 01:22:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:32,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231955427] [2023-02-15 01:22:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:33,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 01:22:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,224 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 01:22:33,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:33,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231955427] [2023-02-15 01:22:33,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231955427] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:33,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:33,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:22:33,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818096846] [2023-02-15 01:22:33,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:33,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:22:33,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:33,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:22:33,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:22:33,226 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:22:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:33,615 INFO L93 Difference]: Finished difference Result 199 states and 223 transitions. [2023-02-15 01:22:33,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:22:33,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-02-15 01:22:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:33,616 INFO L225 Difference]: With dead ends: 199 [2023-02-15 01:22:33,616 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 01:22:33,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:22:33,617 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 173 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:33,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 448 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:22:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 01:22:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2023-02-15 01:22:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 123 states have (on average 1.4796747967479675) internal successors, (182), 172 states have internal predecessors, (182), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 01:22:33,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2023-02-15 01:22:33,621 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 59 [2023-02-15 01:22:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:33,621 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2023-02-15 01:22:33,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:22:33,622 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2023-02-15 01:22:33,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 01:22:33,622 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:33,622 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 01:22:33,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 01:22:33,623 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:33,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:33,623 INFO L85 PathProgramCache]: Analyzing trace with hash -366790066, now seen corresponding path program 1 times [2023-02-15 01:22:33,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:33,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122918981] [2023-02-15 01:22:33,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:33,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 01:22:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 01:22:34,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:34,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122918981] [2023-02-15 01:22:34,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122918981] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:34,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:34,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:22:34,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516620871] [2023-02-15 01:22:34,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:34,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:22:34,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:34,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:22:34,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:22:34,045 INFO L87 Difference]: Start difference. First operand 187 states and 210 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:22:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:34,418 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2023-02-15 01:22:34,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:22:34,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59 [2023-02-15 01:22:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:34,420 INFO L225 Difference]: With dead ends: 194 [2023-02-15 01:22:34,420 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 01:22:34,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:22:34,420 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 374 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:34,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 258 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:34,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 01:22:34,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2023-02-15 01:22:34,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 123 states have (on average 1.4227642276422765) internal successors, (175), 165 states have internal predecessors, (175), 18 states have call successors, (18), 4 states have call predecessors, (18), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 01:22:34,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2023-02-15 01:22:34,425 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 59 [2023-02-15 01:22:34,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:34,426 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2023-02-15 01:22:34,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:22:34,426 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2023-02-15 01:22:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 01:22:34,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:34,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2023-02-15 01:22:34,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 01:22:34,427 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1983741876, now seen corresponding path program 1 times [2023-02-15 01:22:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:34,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950216069] [2023-02-15 01:22:34,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:34,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:34,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:34,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:34,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:34,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 01:22:34,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:35,364 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 01:22:35,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950216069] [2023-02-15 01:22:35,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950216069] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:35,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646457474] [2023-02-15 01:22:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:22:35,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:22:35,365 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 01:22:35,367 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 01:22:35,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:35,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 01:22:35,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:35,654 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 01:22:35,750 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:22:35,750 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 24 treesize of output 19 [2023-02-15 01:22:35,785 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:22:35,786 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 20 treesize of output 8 [2023-02-15 01:22:35,993 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1824 (Array Int Int)) (v_ArrVal_1823 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1823) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1824) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 01:22:36,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:36,028 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 01:22:36,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2023-02-15 01:22:36,038 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 14 treesize of output 10 [2023-02-15 01:22:36,081 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 01:22:36,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-02-15 01:22:36,130 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:22:36,131 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 22 treesize of output 20 [2023-02-15 01:22:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-02-15 01:22:36,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:22:36,183 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 10 treesize of output 8 [2023-02-15 01:22:36,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646457474] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:36,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:22:36,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2023-02-15 01:22:36,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026621139] [2023-02-15 01:22:36,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:22:36,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 01:22:36,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 01:22:36,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 01:22:36,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1067, Unknown=24, NotChecked=66, Total=1260 [2023-02-15 01:22:36,274 INFO L87 Difference]: Start difference. First operand 180 states and 203 transitions. Second operand has 34 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:22:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:38,191 INFO L93 Difference]: Finished difference Result 283 states and 320 transitions. [2023-02-15 01:22:38,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 01:22:38,191 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 64 [2023-02-15 01:22:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:38,193 INFO L225 Difference]: With dead ends: 283 [2023-02-15 01:22:38,193 INFO L226 Difference]: Without dead ends: 283 [2023-02-15 01:22:38,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=288, Invalid=2444, Unknown=28, NotChecked=102, Total=2862 [2023-02-15 01:22:38,194 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 588 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 2874 mSolverCounterSat, 66 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 3232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2874 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:38,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 1556 Invalid, 3232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2874 Invalid, 5 Unknown, 287 Unchecked, 1.3s Time] [2023-02-15 01:22:38,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-02-15 01:22:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 194. [2023-02-15 01:22:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 136 states have (on average 1.4338235294117647) internal successors, (195), 178 states have internal predecessors, (195), 18 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 01:22:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2023-02-15 01:22:38,198 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 64 [2023-02-15 01:22:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:38,198 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2023-02-15 01:22:38,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5588235294117645) internal successors, (87), 31 states have internal predecessors, (87), 6 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 01:22:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2023-02-15 01:22:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 01:22:38,199 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:38,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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 01:22:38,207 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 01:22:38,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-15 01:22:38,405 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 01:22:38,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:38,406 INFO L85 PathProgramCache]: Analyzing trace with hash 578612374, now seen corresponding path program 1 times [2023-02-15 01:22:38,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 01:22:38,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38946396] [2023-02-15 01:22:38,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:38,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 01:22:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 01:22:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:39,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 01:22:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:39,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 01:22:39,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-15 01:22:39,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 01:22:39,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38946396] [2023-02-15 01:22:39,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38946396] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:39,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59968316] [2023-02-15 01:22:39,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:22:39,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:22:39,859 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 01:22:39,861 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 01:22:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:40,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 104 conjunts are in the unsatisfiable core [2023-02-15 01:22:40,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:40,156 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 01:22:40,327 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:22:40,328 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 24 treesize of output 19 [2023-02-15 01:22:40,383 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:22:40,384 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 20 treesize of output 8 [2023-02-15 01:22:40,386 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 01:22:40,654 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2118 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2118))) (store .cse0 |c_chain_node_#in~ppnode#1.base| (store (select .cse0 |c_chain_node_#in~ppnode#1.base|) |c_chain_node_#in~ppnode#1.offset| |chain_node_~node~0#1.base|)))) (not (= |chain_node_~node~0#1.base| 0)) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2023-02-15 01:22:40,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:40,701 INFO L321 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2023-02-15 01:22:40,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 56 treesize of output 104 [2023-02-15 01:22:40,713 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 01:22:40,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 01:22:40,726 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 16 treesize of output 13 [2023-02-15 01:22:40,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:40,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-02-15 01:22:40,765 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2023-02-15 01:22:40,766 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:22:40,804 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:22:40,805 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 34 [2023-02-15 01:22:40,812 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:22:40,815 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:22:41,151 INFO L321 Elim1Store]: treesize reduction 73, result has 39.7 percent of original size [2023-02-15 01:22:41,152 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 5 new quantified variables, introduced 9 case distinctions, treesize of input 1376 treesize of output 1271 [2023-02-15 01:22:41,173 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:22:41,658 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 1238 treesize of output 1198