./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 e8d55036 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-e8d5503-m [2023-02-15 22:12:30,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:12:30,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:12:30,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:12:30,968 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:12:30,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:12:30,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:12:30,971 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:12:30,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:12:30,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:12:30,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:12:30,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:12:30,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:12:30,975 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:12:30,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:12:30,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:12:30,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:12:30,980 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:12:30,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:12:30,984 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:12:30,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:12:30,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:12:30,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:12:30,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:12:30,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:12:30,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:12:30,993 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:12:30,993 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:12:30,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:12:30,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:12:30,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:12:30,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:12:30,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:12:30,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:12:30,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:12:30,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:12:30,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:12:30,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:12:30,997 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:12:30,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:12:30,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:12:31,000 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 22:12:31,021 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:12:31,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:12:31,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:12:31,022 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:12:31,022 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:12:31,022 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:12:31,023 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:12:31,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:12:31,023 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:12:31,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:12:31,023 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:12:31,024 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:12:31,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:12:31,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:12:31,025 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:12:31,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:12:31,026 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:12:31,026 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 22:12:31,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:12:31,224 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:12:31,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:12:31,226 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:12:31,232 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:12:31,233 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 22:12:32,147 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:12:32,349 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:12:32,350 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-2.i [2023-02-15 22:12:32,363 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8cae9a3/d229033d37e34f959969b9aa2cbd99fa/FLAG8b5b0a770 [2023-02-15 22:12:32,371 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e8cae9a3/d229033d37e34f959969b9aa2cbd99fa [2023-02-15 22:12:32,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:12:32,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:12:32,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:12:32,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:12:32,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:12:32,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521558d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32, skipping insertion in model container [2023-02-15 22:12:32,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:12:32,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:12:32,599 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 22:12:32,632 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:12:32,638 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:12:32,656 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 22:12:32,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:12:32,704 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:12:32,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32 WrapperNode [2023-02-15 22:12:32,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:12:32,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:12:32,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:12:32,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:12:32,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,725 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,741 INFO L138 Inliner]: procedures = 129, calls = 79, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 203 [2023-02-15 22:12:32,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:12:32,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:12:32,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:12:32,745 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:12:32,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,761 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,761 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,794 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:12:32,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:12:32,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:12:32,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:12:32,798 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (1/1) ... [2023-02-15 22:12:32,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:12:32,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:32,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 22:12:32,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 22:12:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 22:12:32,875 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 22:12:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:12:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:12:32,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:12:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:12:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:12:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_prev [2023-02-15 22:12:32,876 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_prev [2023-02-15 22:12:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:12:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:12:32,876 INFO L130 BoogieDeclarations]: Found specification of procedure chain_node [2023-02-15 22:12:32,877 INFO L138 BoogieDeclarations]: Found implementation of procedure chain_node [2023-02-15 22:12:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 22:12:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure check_seq_next [2023-02-15 22:12:32,877 INFO L138 BoogieDeclarations]: Found implementation of procedure check_seq_next [2023-02-15 22:12:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:12:32,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:12:33,000 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:12:33,001 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:12:33,389 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:12:33,395 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:12:33,395 INFO L300 CfgBuilder]: Removed 33 assume(true) statements. [2023-02-15 22:12:33,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:12:33 BoogieIcfgContainer [2023-02-15 22:12:33,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:12:33,398 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:12:33,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:12:33,400 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:12:33,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:12:32" (1/3) ... [2023-02-15 22:12:33,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ada91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:12:33, skipping insertion in model container [2023-02-15 22:12:33,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:12:32" (2/3) ... [2023-02-15 22:12:33,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ada91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:12:33, skipping insertion in model container [2023-02-15 22:12:33,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:12:33" (3/3) ... [2023-02-15 22:12:33,402 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-2.i [2023-02-15 22:12:33,413 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:12:33,413 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 83 error locations. [2023-02-15 22:12:33,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:12:33,449 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;@4529ecf0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:12:33,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2023-02-15 22:12:33,452 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 22:12:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:12:33,456 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:33,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:12:33,456 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 22:12:33,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:33,459 INFO L85 PathProgramCache]: Analyzing trace with hash 6220774, now seen corresponding path program 1 times [2023-02-15 22:12:33,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:33,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764761515] [2023-02-15 22:12:33,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:33,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:33,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:33,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764761515] [2023-02-15 22:12:33,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764761515] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:33,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:33,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725121903] [2023-02-15 22:12:33,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:33,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:12:33,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:33,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:12:33,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:12:33,616 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 22:12:33,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:33,643 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2023-02-15 22:12:33,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:12:33,644 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 22:12:33,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:33,650 INFO L225 Difference]: With dead ends: 221 [2023-02-15 22:12:33,650 INFO L226 Difference]: Without dead ends: 219 [2023-02-15 22:12:33,651 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 22:12:33,653 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 22:12:33,654 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 22:12:33,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-15 22:12:33,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2023-02-15 22:12:33,692 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 22:12:33,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2023-02-15 22:12:33,697 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 4 [2023-02-15 22:12:33,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:33,697 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2023-02-15 22:12:33,697 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 22:12:33,697 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2023-02-15 22:12:33,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:12:33,698 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:33,698 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:12:33,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 22:12:33,698 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 22:12:33,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:33,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154958, now seen corresponding path program 1 times [2023-02-15 22:12:33,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:33,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508571630] [2023-02-15 22:12:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:33,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:33,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508571630] [2023-02-15 22:12:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508571630] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:33,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:33,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136841841] [2023-02-15 22:12:33,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:33,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:33,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:33,809 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 22:12:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:33,921 INFO L93 Difference]: Finished difference Result 217 states and 238 transitions. [2023-02-15 22:12:33,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:33,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:12:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:33,922 INFO L225 Difference]: With dead ends: 217 [2023-02-15 22:12:33,922 INFO L226 Difference]: Without dead ends: 217 [2023-02-15 22:12:33,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:33,924 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 22:12:33,924 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 22:12:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-15 22:12:33,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-02-15 22:12:33,931 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 22:12:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2023-02-15 22:12:33,934 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 6 [2023-02-15 22:12:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:33,934 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2023-02-15 22:12:33,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:33,934 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2023-02-15 22:12:33,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 22:12:33,935 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:33,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 22:12:33,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 22:12:33,935 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 22:12:33,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:33,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1692154959, now seen corresponding path program 1 times [2023-02-15 22:12:33,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:33,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425129137] [2023-02-15 22:12:33,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:33,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:33,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:33,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:33,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425129137] [2023-02-15 22:12:33,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425129137] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:33,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:33,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:12:33,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462706780] [2023-02-15 22:12:33,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:33,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:12:33,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:33,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:12:33,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:33,998 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 22:12:34,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:34,078 INFO L93 Difference]: Finished difference Result 215 states and 236 transitions. [2023-02-15 22:12:34,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:12:34,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 22:12:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:34,082 INFO L225 Difference]: With dead ends: 215 [2023-02-15 22:12:34,082 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 22:12:34,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:12:34,083 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 22:12:34,083 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 22:12:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 22:12:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-02-15 22:12:34,090 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 22:12:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 236 transitions. [2023-02-15 22:12:34,091 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 236 transitions. Word has length 6 [2023-02-15 22:12:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:34,091 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 236 transitions. [2023-02-15 22:12:34,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:12:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 236 transitions. [2023-02-15 22:12:34,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:12:34,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:34,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:34,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 22:12:34,093 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 22:12:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:34,093 INFO L85 PathProgramCache]: Analyzing trace with hash -387700622, now seen corresponding path program 1 times [2023-02-15 22:12:34,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:34,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542590832] [2023-02-15 22:12:34,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:34,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:34,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:34,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542590832] [2023-02-15 22:12:34,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542590832] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:34,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:34,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:12:34,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673444290] [2023-02-15 22:12:34,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:34,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:12:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:34,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:12:34,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:12:34,285 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 22:12:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:34,438 INFO L93 Difference]: Finished difference Result 210 states and 231 transitions. [2023-02-15 22:12:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:34,439 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 22:12:34,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:34,439 INFO L225 Difference]: With dead ends: 210 [2023-02-15 22:12:34,439 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 22:12:34,440 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 22:12:34,447 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.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:34,448 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.1s Time] [2023-02-15 22:12:34,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 22:12:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-02-15 22:12:34,460 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 22:12:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 231 transitions. [2023-02-15 22:12:34,461 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 231 transitions. Word has length 10 [2023-02-15 22:12:34,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:34,462 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 231 transitions. [2023-02-15 22:12:34,462 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 22:12:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 231 transitions. [2023-02-15 22:12:34,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:12:34,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:34,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:34,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 22:12:34,463 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 22:12:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash -387700621, now seen corresponding path program 1 times [2023-02-15 22:12:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:34,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408591010] [2023-02-15 22:12:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:34,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:34,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:34,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408591010] [2023-02-15 22:12:34,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408591010] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:34,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:34,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:34,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027661516] [2023-02-15 22:12:34,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:34,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:34,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:34,641 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 22:12:34,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:34,851 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2023-02-15 22:12:34,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:34,853 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 22:12:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:34,854 INFO L225 Difference]: With dead ends: 205 [2023-02-15 22:12:34,854 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 22:12:34,855 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 22:12:34,858 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 39 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 22:12:34,858 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 22:12:34,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 22:12:34,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2023-02-15 22:12:34,868 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 22:12:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2023-02-15 22:12:34,870 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 10 [2023-02-15 22:12:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:34,871 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2023-02-15 22:12:34,871 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 22:12:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2023-02-15 22:12:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:12:34,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:34,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:34,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 22:12:34,872 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 22:12:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash 866182740, now seen corresponding path program 1 times [2023-02-15 22:12:34,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:34,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463669447] [2023-02-15 22:12:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:34,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:34,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463669447] [2023-02-15 22:12:34,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463669447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:34,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:34,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:34,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726125063] [2023-02-15 22:12:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:34,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:34,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:34,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:34,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:34,917 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 22:12:35,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:35,059 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2023-02-15 22:12:35,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:35,059 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 22:12:35,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:35,060 INFO L225 Difference]: With dead ends: 204 [2023-02-15 22:12:35,060 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 22:12:35,060 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 22:12:35,061 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 22:12:35,061 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 22:12:35,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 22:12:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2023-02-15 22:12:35,066 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 22:12:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2023-02-15 22:12:35,066 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 11 [2023-02-15 22:12:35,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:35,067 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2023-02-15 22:12:35,067 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 22:12:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2023-02-15 22:12:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 22:12:35,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:35,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:12:35,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 22:12:35,068 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 22:12:35,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash 866182741, now seen corresponding path program 1 times [2023-02-15 22:12:35,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:35,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215692997] [2023-02-15 22:12:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:35,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:35,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:35,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215692997] [2023-02-15 22:12:35,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215692997] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:35,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:35,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:12:35,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767265067] [2023-02-15 22:12:35,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:35,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:12:35,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:35,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:12:35,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:12:35,152 INFO L87 Difference]: Start difference. First operand 204 states and 225 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 22:12:35,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:35,293 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2023-02-15 22:12:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:35,293 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 22:12:35,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:35,294 INFO L225 Difference]: With dead ends: 203 [2023-02-15 22:12:35,294 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 22:12:35,295 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 22:12:35,295 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 17 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:35,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 645 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:12:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 22:12:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-02-15 22:12:35,298 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 22:12:35,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2023-02-15 22:12:35,299 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 11 [2023-02-15 22:12:35,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:35,299 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2023-02-15 22:12:35,299 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 22:12:35,300 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2023-02-15 22:12:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:12:35,300 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:35,300 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 22:12:35,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 22:12:35,300 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 22:12:35,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:35,301 INFO L85 PathProgramCache]: Analyzing trace with hash -610249734, now seen corresponding path program 1 times [2023-02-15 22:12:35,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:35,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194375585] [2023-02-15 22:12:35,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:35,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:35,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:35,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:35,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194375585] [2023-02-15 22:12:35,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194375585] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:35,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:35,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:12:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479853633] [2023-02-15 22:12:35,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:35,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:12:35,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:35,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:12:35,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:35,616 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 22:12:36,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:36,031 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2023-02-15 22:12:36,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:12:36,031 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 22:12:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:36,032 INFO L225 Difference]: With dead ends: 202 [2023-02-15 22:12:36,032 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 22:12:36,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:12:36,033 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 76 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:36,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 526 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:12:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 22:12:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2023-02-15 22:12:36,036 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 22:12:36,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 223 transitions. [2023-02-15 22:12:36,037 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 223 transitions. Word has length 19 [2023-02-15 22:12:36,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:36,037 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 223 transitions. [2023-02-15 22:12:36,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 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 22:12:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2023-02-15 22:12:36,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 22:12:36,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:36,038 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 22:12:36,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 22:12:36,039 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 22:12:36,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash -610249733, now seen corresponding path program 1 times [2023-02-15 22:12:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:36,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825990402] [2023-02-15 22:12:36,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:12:36,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:36,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825990402] [2023-02-15 22:12:36,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825990402] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:36,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:36,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:12:36,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138813429] [2023-02-15 22:12:36,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:36,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:12:36,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:36,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:12:36,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:12:36,219 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 22:12:36,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:36,443 INFO L93 Difference]: Finished difference Result 201 states and 222 transitions. [2023-02-15 22:12:36,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:36,444 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 22:12:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:36,444 INFO L225 Difference]: With dead ends: 201 [2023-02-15 22:12:36,444 INFO L226 Difference]: Without dead ends: 201 [2023-02-15 22:12:36,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 22:12:36,445 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 376 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:36,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 186 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2023-02-15 22:12:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2023-02-15 22:12:36,448 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 22:12:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 222 transitions. [2023-02-15 22:12:36,448 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 222 transitions. Word has length 19 [2023-02-15 22:12:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:36,448 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 222 transitions. [2023-02-15 22:12:36,449 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 22:12:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 222 transitions. [2023-02-15 22:12:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:12:36,449 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:36,449 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 22:12:36,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 22:12:36,449 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:36,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash 50383991, now seen corresponding path program 1 times [2023-02-15 22:12:36,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:36,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837866033] [2023-02-15 22:12:36,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:36,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,851 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 22:12:36,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837866033] [2023-02-15 22:12:36,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837866033] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:36,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587317062] [2023-02-15 22:12:36,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:36,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:36,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:36,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:12:36,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:12:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:36,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 33 conjunts are in the unsatisfiable core [2023-02-15 22:12:36,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:37,059 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-15 22:12:37,059 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 3 case distinctions, treesize of input 22 treesize of output 31 [2023-02-15 22:12:37,142 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:12:37,142 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 25 treesize of output 29 [2023-02-15 22:12:37,176 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_438 Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_438))))) is different from true [2023-02-15 22:12:37,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:37,284 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 22:12:37,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 40 [2023-02-15 22:12:37,368 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 22:12:37,382 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_439 Int)) (= |c_#valid| (store |c_old(#valid)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_439))))) is different from true [2023-02-15 22:12:37,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:37,453 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 22:12:37,473 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 22:12:37,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:37,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587317062] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:37,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:12:37,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-02-15 22:12:37,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885681127] [2023-02-15 22:12:37,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:37,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 22:12:37,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 22:12:37,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=220, Unknown=2, NotChecked=62, Total=342 [2023-02-15 22:12:37,550 INFO L87 Difference]: Start difference. First operand 201 states and 222 transitions. Second operand has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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 22:12:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:38,071 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2023-02-15 22:12:38,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:12:38,072 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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 22:12:38,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:38,073 INFO L225 Difference]: With dead ends: 200 [2023-02-15 22:12:38,073 INFO L226 Difference]: Without dead ends: 200 [2023-02-15 22:12:38,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=304, Unknown=2, NotChecked=74, Total=462 [2023-02-15 22:12:38,073 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 208 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 420 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:38,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 622 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 846 Invalid, 0 Unknown, 420 Unchecked, 0.4s Time] [2023-02-15 22:12:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-15 22:12:38,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2023-02-15 22:12:38,076 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 22:12:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2023-02-15 22:12:38,077 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 37 [2023-02-15 22:12:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:38,077 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2023-02-15 22:12:38,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 4.571428571428571) internal successors, (64), 15 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 22:12:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2023-02-15 22:12:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:12:38,078 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:38,078 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 22:12:38,086 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 22:12:38,283 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 22:12:38,283 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:38,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:38,284 INFO L85 PathProgramCache]: Analyzing trace with hash 50383992, now seen corresponding path program 1 times [2023-02-15 22:12:38,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:38,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58820570] [2023-02-15 22:12:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:38,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:38,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 22:12:38,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:38,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58820570] [2023-02-15 22:12:38,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58820570] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:38,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:38,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:12:38,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436799844] [2023-02-15 22:12:38,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:38,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:12:38,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:38,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:12:38,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:12:38,642 INFO L87 Difference]: Start difference. First operand 200 states and 221 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:12:38,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:38,921 INFO L93 Difference]: Finished difference Result 199 states and 220 transitions. [2023-02-15 22:12:38,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:12:38,922 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2023-02-15 22:12:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:38,923 INFO L225 Difference]: With dead ends: 199 [2023-02-15 22:12:38,923 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 22:12:38,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 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 22:12:38,923 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 189 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:38,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 238 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 22:12:38,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2023-02-15 22:12:38,926 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 22:12:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 220 transitions. [2023-02-15 22:12:38,927 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 220 transitions. Word has length 37 [2023-02-15 22:12:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:38,927 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 220 transitions. [2023-02-15 22:12:38,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:12:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 220 transitions. [2023-02-15 22:12:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:12:38,928 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:38,928 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 22:12:38,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 22:12:38,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:38,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash 819452048, now seen corresponding path program 1 times [2023-02-15 22:12:38,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:38,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486914217] [2023-02-15 22:12:38,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:38,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:12:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,246 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 22:12:39,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:39,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486914217] [2023-02-15 22:12:39,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486914217] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:39,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:39,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:12:39,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752782730] [2023-02-15 22:12:39,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:39,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:12:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:39,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:12:39,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:12:39,247 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 22:12:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:39,520 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2023-02-15 22:12:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:12:39,520 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 22:12:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:39,521 INFO L225 Difference]: With dead ends: 204 [2023-02-15 22:12:39,521 INFO L226 Difference]: Without dead ends: 204 [2023-02-15 22:12:39,521 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 22:12:39,521 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 238 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:39,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 306 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-15 22:12:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 192. [2023-02-15 22:12:39,524 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 22:12:39,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2023-02-15 22:12:39,525 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 58 [2023-02-15 22:12:39,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:39,525 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2023-02-15 22:12:39,525 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 22:12:39,525 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2023-02-15 22:12:39,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-15 22:12:39,526 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:39,526 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 22:12:39,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 22:12:39,526 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash 819452049, now seen corresponding path program 1 times [2023-02-15 22:12:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584735675] [2023-02-15 22:12:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:12:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:39,807 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 22:12:39,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:39,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584735675] [2023-02-15 22:12:39,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584735675] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:39,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:39,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:12:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753807328] [2023-02-15 22:12:39,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:39,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:12:39,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:12:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:12:39,809 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 22:12:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:40,165 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2023-02-15 22:12:40,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:12:40,166 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 22:12:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:40,168 INFO L225 Difference]: With dead ends: 215 [2023-02-15 22:12:40,168 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 22:12:40,168 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 22:12:40,168 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 22:12:40,168 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 22:12:40,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 22:12:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 194. [2023-02-15 22:12:40,172 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 22:12:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2023-02-15 22:12:40,174 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 58 [2023-02-15 22:12:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:40,174 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2023-02-15 22:12:40,174 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 22:12:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2023-02-15 22:12:40,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:12:40,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:40,176 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 22:12:40,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 22:12:40,176 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:40,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash -366790067, now seen corresponding path program 1 times [2023-02-15 22:12:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:40,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774789516] [2023-02-15 22:12:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:40,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:40,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:40,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:40,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:12:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:40,561 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 22:12:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774789516] [2023-02-15 22:12:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774789516] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:40,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:40,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:12:40,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386898525] [2023-02-15 22:12:40,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:40,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:12:40,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:12:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:40,563 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 22:12:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:40,908 INFO L93 Difference]: Finished difference Result 199 states and 223 transitions. [2023-02-15 22:12:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:12:40,908 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 22:12:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:40,909 INFO L225 Difference]: With dead ends: 199 [2023-02-15 22:12:40,909 INFO L226 Difference]: Without dead ends: 199 [2023-02-15 22:12:40,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 1 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 22:12:40,909 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 173 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:40,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 385 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:12:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-02-15 22:12:40,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 187. [2023-02-15 22:12:40,912 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 22:12:40,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 210 transitions. [2023-02-15 22:12:40,912 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 210 transitions. Word has length 59 [2023-02-15 22:12:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:40,914 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 210 transitions. [2023-02-15 22:12:40,914 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 22:12:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 210 transitions. [2023-02-15 22:12:40,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:12:40,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:40,915 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 22:12:40,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 22:12:40,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:40,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -366790066, now seen corresponding path program 1 times [2023-02-15 22:12:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:40,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882941464] [2023-02-15 22:12:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:40,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:12:41,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,238 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 22:12:41,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:41,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882941464] [2023-02-15 22:12:41,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882941464] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:12:41,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:12:41,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 22:12:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315880299] [2023-02-15 22:12:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:12:41,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 22:12:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:41,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 22:12:41,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:12:41,241 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 22:12:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:41,514 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2023-02-15 22:12:41,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:12:41,514 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 22:12:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:41,515 INFO L225 Difference]: With dead ends: 194 [2023-02-15 22:12:41,515 INFO L226 Difference]: Without dead ends: 194 [2023-02-15 22:12:41,515 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 22:12:41,515 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 350 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:41,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 153 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:12:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-02-15 22:12:41,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 180. [2023-02-15 22:12:41,518 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 22:12:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 203 transitions. [2023-02-15 22:12:41,519 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 203 transitions. Word has length 59 [2023-02-15 22:12:41,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:41,519 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 203 transitions. [2023-02-15 22:12:41,519 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 22:12:41,519 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 203 transitions. [2023-02-15 22:12:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 22:12:41,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:41,520 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 22:12:41,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 22:12:41,520 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:41,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:41,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1983741876, now seen corresponding path program 1 times [2023-02-15 22:12:41,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:41,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354761757] [2023-02-15 22:12:41,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:41,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:12:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:42,426 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 22:12:42,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354761757] [2023-02-15 22:12:42,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354761757] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:42,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060171010] [2023-02-15 22:12:42,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:42,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:42,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:42,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:12:42,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:12:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:42,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 22:12:42,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:42,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:12:42,808 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:12:42,808 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 22:12:42,853 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:12:42,853 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 22:12:43,087 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1559 (Array Int Int)) (v_ArrVal_1558 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1558) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1559)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:12:43,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:43,111 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 22:12:43,111 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 22:12:43,120 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 22:12:43,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:12:43,242 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 16 treesize of output 8 [2023-02-15 22:12:43,251 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 22:12:43,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:43,297 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 22:12:43,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060171010] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:43,405 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:12:43,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 34 [2023-02-15 22:12:43,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025548949] [2023-02-15 22:12:43,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:43,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 22:12:43,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:43,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 22:12:43,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1066, Unknown=25, NotChecked=66, Total=1260 [2023-02-15 22:12:43,407 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 22:12:45,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:45,478 INFO L93 Difference]: Finished difference Result 283 states and 320 transitions. [2023-02-15 22:12:45,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 22:12:45,479 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 22:12:45,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:45,480 INFO L225 Difference]: With dead ends: 283 [2023-02-15 22:12:45,480 INFO L226 Difference]: Without dead ends: 283 [2023-02-15 22:12:45,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=2354, Unknown=31, NotChecked=100, Total=2756 [2023-02-15 22:12:45,481 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 655 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 2935 mSolverCounterSat, 75 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 3317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2935 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:45,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2115 Invalid, 3317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2935 Invalid, 10 Unknown, 297 Unchecked, 1.4s Time] [2023-02-15 22:12:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-02-15 22:12:45,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 194. [2023-02-15 22:12:45,484 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 22:12:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 223 transitions. [2023-02-15 22:12:45,485 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 223 transitions. Word has length 64 [2023-02-15 22:12:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:45,485 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 223 transitions. [2023-02-15 22:12:45,485 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 22:12:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 223 transitions. [2023-02-15 22:12:45,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:12:45,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:45,486 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 22:12:45,498 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 22:12:45,686 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,SelfDestructingSolverStorable15 [2023-02-15 22:12:45,686 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 22:12:45,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash 578612374, now seen corresponding path program 1 times [2023-02-15 22:12:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:45,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112081048] [2023-02-15 22:12:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:46,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:12:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:47,177 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 22:12:47,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112081048] [2023-02-15 22:12:47,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112081048] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:47,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2437969] [2023-02-15 22:12:47,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:47,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:47,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:47,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:12:47,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:12:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:47,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-15 22:12:47,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:47,387 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 22:12:47,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:12:47,586 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:12:47,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2023-02-15 22:12:47,632 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:12:47,632 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 22:12:47,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:12:47,889 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1857 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_1858 (Array Int Int))) (and (= 0 (select |c_old(#valid)| |chain_node_~node~0#1.base|)) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1857) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1858)))) is different from true [2023-02-15 22:12:47,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:47,930 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 22:12:47,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 45 [2023-02-15 22:12:47,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 22:12:47,948 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:12:47,948 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 22:12:48,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-02-15 22:12:48,072 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 12 treesize of output 8 [2023-02-15 22:12:48,293 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int)) (|chain_node_~node~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_1862) |c_chain_node_#in~ppnode#1.base| v_ArrVal_1863)) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:12:48,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:48,322 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:12:48,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 34 [2023-02-15 22:12:48,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:12:48,461 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 16 treesize of output 8 [2023-02-15 22:12:48,469 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-15 22:12:48,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:12:48,529 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 22:12:48,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2437969] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:48,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:12:48,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 31] total 44 [2023-02-15 22:12:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85605368] [2023-02-15 22:12:48,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:12:48,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-02-15 22:12:48,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:12:48,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-02-15 22:12:48,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1720, Unknown=19, NotChecked=170, Total=2070 [2023-02-15 22:12:48,642 INFO L87 Difference]: Start difference. First operand 194 states and 223 transitions. Second operand has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:12:51,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:12:51,195 INFO L93 Difference]: Finished difference Result 282 states and 318 transitions. [2023-02-15 22:12:51,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 22:12:51,195 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-02-15 22:12:51,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:12:51,196 INFO L225 Difference]: With dead ends: 282 [2023-02-15 22:12:51,196 INFO L226 Difference]: Without dead ends: 282 [2023-02-15 22:12:51,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=3485, Unknown=23, NotChecked=246, Total=4160 [2023-02-15 22:12:51,198 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 713 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 3410 mSolverCounterSat, 90 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 4095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3410 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 588 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:12:51,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1796 Invalid, 4095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3410 Invalid, 7 Unknown, 588 Unchecked, 1.7s Time] [2023-02-15 22:12:51,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-02-15 22:12:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 194. [2023-02-15 22:12:51,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 136 states have (on average 1.4264705882352942) internal successors, (194), 178 states have internal predecessors, (194), 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 22:12:51,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 222 transitions. [2023-02-15 22:12:51,202 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 222 transitions. Word has length 66 [2023-02-15 22:12:51,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:12:51,202 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 222 transitions. [2023-02-15 22:12:51,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 2.097560975609756) internal successors, (86), 40 states have internal predecessors, (86), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:12:51,203 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 222 transitions. [2023-02-15 22:12:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:12:51,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:12:51,203 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 22:12:51,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:12:51,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:51,410 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:12:51,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:12:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash 578601438, now seen corresponding path program 1 times [2023-02-15 22:12:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:12:51,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998860446] [2023-02-15 22:12:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:12:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:12:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:12:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:52,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:12:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:12:52,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:12:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998860446] [2023-02-15 22:12:52,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998860446] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:12:52,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563301720] [2023-02-15 22:12:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:12:52,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:12:52,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:12:52,746 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:12:52,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:12:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:12:52,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 22:12:52,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:12:53,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:12:53,230 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 22:12:53,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:12:53,355 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:12:53,355 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 33 treesize of output 24 [2023-02-15 22:12:53,409 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:12:53,409 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 29 treesize of output 13 [2023-02-15 22:12:53,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:12:53,789 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 22:12:53,789 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 38 treesize of output 52 [2023-02-15 22:12:53,801 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-02-15 22:12:53,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:12:53,813 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 21 treesize of output 15 [2023-02-15 22:12:53,819 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 22:12:53,931 INFO L321 Elim1Store]: treesize reduction 40, result has 40.3 percent of original size [2023-02-15 22:12:53,932 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 34 treesize of output 51 [2023-02-15 22:12:54,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:13:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:13:00,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:00,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563301720] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:00,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:13:00,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 46 [2023-02-15 22:13:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592479061] [2023-02-15 22:13:00,553 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:00,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-02-15 22:13:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-02-15 22:13:00,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2278, Unknown=7, NotChecked=0, Total=2450 [2023-02-15 22:13:00,555 INFO L87 Difference]: Start difference. First operand 194 states and 222 transitions. Second operand has 47 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 42 states have internal predecessors, (107), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:13:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:05,567 INFO L93 Difference]: Finished difference Result 266 states and 301 transitions. [2023-02-15 22:13:05,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:13:05,568 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 42 states have internal predecessors, (107), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-02-15 22:13:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:05,569 INFO L225 Difference]: With dead ends: 266 [2023-02-15 22:13:05,569 INFO L226 Difference]: Without dead ends: 266 [2023-02-15 22:13:05,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=376, Invalid=4027, Unknown=19, NotChecked=0, Total=4422 [2023-02-15 22:13:05,570 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 516 mSDsluCounter, 2387 mSDsCounter, 0 mSdLazyCounter, 4394 mSolverCounterSat, 90 mSolverCounterUnsat, 142 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 2503 SdHoareTripleChecker+Invalid, 4626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 4394 IncrementalHoareTripleChecker+Invalid, 142 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:05,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 2503 Invalid, 4626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 4394 Invalid, 142 Unknown, 0 Unchecked, 2.5s Time] [2023-02-15 22:13:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-15 22:13:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 194. [2023-02-15 22:13:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 136 states have (on average 1.4191176470588236) internal successors, (193), 178 states have internal predecessors, (193), 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 22:13:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 221 transitions. [2023-02-15 22:13:05,574 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 221 transitions. Word has length 66 [2023-02-15 22:13:05,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:05,575 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 221 transitions. [2023-02-15 22:13:05,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.4318181818181817) internal successors, (107), 42 states have internal predecessors, (107), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:13:05,575 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 221 transitions. [2023-02-15 22:13:05,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 22:13:05,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:05,575 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 22:13:05,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:13:05,781 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,SelfDestructingSolverStorable17 [2023-02-15 22:13:05,781 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:13:05,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:05,782 INFO L85 PathProgramCache]: Analyzing trace with hash 578601439, now seen corresponding path program 1 times [2023-02-15 22:13:05,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:05,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107821094] [2023-02-15 22:13:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:05,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:13:06,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:06,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:13:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:06,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:13:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:08,533 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 22:13:08,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:08,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107821094] [2023-02-15 22:13:08,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107821094] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:08,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770832552] [2023-02-15 22:13:08,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:08,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:08,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:08,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:13:08,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:13:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:08,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 105 conjunts are in the unsatisfiable core [2023-02-15 22:13:08,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:08,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:08,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:08,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:09,028 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:13:09,028 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 25 treesize of output 20 [2023-02-15 22:13:09,039 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:13:09,039 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 23 treesize of output 18 [2023-02-15 22:13:09,096 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:09,097 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 21 treesize of output 9 [2023-02-15 22:13:09,102 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:09,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 22:13:09,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:09,520 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 22:13:09,520 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 28 treesize of output 44 [2023-02-15 22:13:09,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:13:09,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:09,562 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 22:13:09,562 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 30 treesize of output 46 [2023-02-15 22:13:09,574 INFO L321 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-02-15 22:13:09,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 22:13:09,580 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 15 treesize of output 11 [2023-02-15 22:13:09,594 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 7 treesize of output 5 [2023-02-15 22:13:09,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:09,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:13:09,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:13:09,848 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:13:09,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:13:09,874 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 24 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 22:13:09,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:10,046 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 22:13:10,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770832552] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:10,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:13:10,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 32 [2023-02-15 22:13:10,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602331796] [2023-02-15 22:13:10,408 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:10,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-15 22:13:10,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:10,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-15 22:13:10,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1343, Unknown=15, NotChecked=0, Total=1482 [2023-02-15 22:13:10,410 INFO L87 Difference]: Start difference. First operand 194 states and 221 transitions. Second operand has 33 states, 32 states have (on average 2.71875) internal successors, (87), 30 states have internal predecessors, (87), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:13:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:13,608 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2023-02-15 22:13:13,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 22:13:13,608 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 30 states have internal predecessors, (87), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 66 [2023-02-15 22:13:13,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:13,609 INFO L225 Difference]: With dead ends: 268 [2023-02-15 22:13:13,610 INFO L226 Difference]: Without dead ends: 268 [2023-02-15 22:13:13,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 66 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=292, Invalid=2655, Unknown=23, NotChecked=0, Total=2970 [2023-02-15 22:13:13,611 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 604 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 3065 mSolverCounterSat, 87 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 3184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3065 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:13,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1194 Invalid, 3184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3065 Invalid, 32 Unknown, 0 Unchecked, 2.3s Time] [2023-02-15 22:13:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-15 22:13:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 194. [2023-02-15 22:13:13,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 136 states have (on average 1.411764705882353) internal successors, (192), 178 states have internal predecessors, (192), 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 22:13:13,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 220 transitions. [2023-02-15 22:13:13,615 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 220 transitions. Word has length 66 [2023-02-15 22:13:13,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:13,615 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 220 transitions. [2023-02-15 22:13:13,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.71875) internal successors, (87), 30 states have internal predecessors, (87), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 22:13:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 220 transitions. [2023-02-15 22:13:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 22:13:13,616 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:13,616 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, 1, 1, 1, 1, 1] [2023-02-15 22:13:13,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-15 22:13:13,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:13,822 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:13:13,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:13,822 INFO L85 PathProgramCache]: Analyzing trace with hash -574790864, now seen corresponding path program 1 times [2023-02-15 22:13:13,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:13,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583256746] [2023-02-15 22:13:13,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:15,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:13:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:15,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:13:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:13:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:18,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:13:18,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:18,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583256746] [2023-02-15 22:13:18,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583256746] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:18,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263902754] [2023-02-15 22:13:18,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:18,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:18,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:18,326 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:13:18,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:13:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:18,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 138 conjunts are in the unsatisfiable core [2023-02-15 22:13:18,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:18,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:18,793 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:13:18,795 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 15 treesize of output 21 [2023-02-15 22:13:18,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-15 22:13:18,878 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 12 treesize of output 8 [2023-02-15 22:13:18,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:19,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:19,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:19,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:19,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2023-02-15 22:13:19,514 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 0 case distinctions, treesize of input 29 treesize of output 24 [2023-02-15 22:13:19,522 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 12 treesize of output 11 [2023-02-15 22:13:19,746 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:13:19,746 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 23 treesize of output 18 [2023-02-15 22:13:19,766 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 22:13:19,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 41 [2023-02-15 22:13:19,911 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 22:13:19,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 23 [2023-02-15 22:13:19,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:13:19,918 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:19,919 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 15 treesize of output 7 [2023-02-15 22:13:20,369 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2796 (Array Int Int)) (|chain_node_~node~0#1.base| Int) (v_ArrVal_2795 (Array Int Int)) (v_ArrVal_2794 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (and (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_2794) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2796)) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_2793) |c_chain_node_#in~ppnode#1.base| v_ArrVal_2795)) (<= (+ |chain_node_~node~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |chain_node_~node~0#1.base|) 0))) is different from true [2023-02-15 22:13:20,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:20,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:20,407 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-02-15 22:13:20,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 38 [2023-02-15 22:13:20,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:13:20,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:20,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:20,454 INFO L321 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2023-02-15 22:13:20,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 76 [2023-02-15 22:13:20,462 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-02-15 22:13:20,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:13:20,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-02-15 22:13:20,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:20,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:13:21,021 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-02-15 22:13:21,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:13:21,278 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:21,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2023-02-15 22:13:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 22:13:21,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:21,537 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:21,537 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 19 treesize of output 15 [2023-02-15 22:13:21,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263902754] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:21,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:13:21,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35] total 62 [2023-02-15 22:13:21,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857440899] [2023-02-15 22:13:21,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:21,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-02-15 22:13:21,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:21,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-02-15 22:13:21,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=4224, Unknown=4, NotChecked=130, Total=4556 [2023-02-15 22:13:21,799 INFO L87 Difference]: Start difference. First operand 194 states and 220 transitions. Second operand has 62 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:13:28,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:28,272 INFO L93 Difference]: Finished difference Result 282 states and 320 transitions. [2023-02-15 22:13:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-02-15 22:13:28,273 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 71 [2023-02-15 22:13:28,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:28,274 INFO L225 Difference]: With dead ends: 282 [2023-02-15 22:13:28,274 INFO L226 Difference]: Without dead ends: 282 [2023-02-15 22:13:28,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 94 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1944 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=586, Invalid=8340, Unknown=8, NotChecked=186, Total=9120 [2023-02-15 22:13:28,275 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 747 mSDsluCounter, 2536 mSDsCounter, 0 mSdLazyCounter, 5747 mSolverCounterSat, 152 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 6202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 5747 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:28,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 2627 Invalid, 6202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 5747 Invalid, 4 Unknown, 299 Unchecked, 3.5s Time] [2023-02-15 22:13:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2023-02-15 22:13:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 196. [2023-02-15 22:13:28,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 138 states have (on average 1.4130434782608696) internal successors, (195), 180 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 22:13:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 223 transitions. [2023-02-15 22:13:28,279 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 223 transitions. Word has length 71 [2023-02-15 22:13:28,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:28,280 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 223 transitions. [2023-02-15 22:13:28,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 57 states have internal predecessors, (113), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:13:28,280 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 223 transitions. [2023-02-15 22:13:28,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-02-15 22:13:28,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:28,280 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, 1, 1, 1, 1, 1] [2023-02-15 22:13:28,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-15 22:13:28,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:28,488 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting check_seq_nextErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:13:28,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:28,489 INFO L85 PathProgramCache]: Analyzing trace with hash -574800934, now seen corresponding path program 1 times [2023-02-15 22:13:28,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:28,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039524557] [2023-02-15 22:13:28,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:28,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:29,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:13:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:29,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:13:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:30,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:13:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:31,546 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:13:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:31,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039524557] [2023-02-15 22:13:31,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039524557] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:31,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238126369] [2023-02-15 22:13:31,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:31,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:31,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:31,548 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:13:31,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:13:31,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:31,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 188 conjunts are in the unsatisfiable core [2023-02-15 22:13:31,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:31,790 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 22:13:31,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:31,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:32,233 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:13:32,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2023-02-15 22:13:32,256 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:13:32,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 22:13:32,347 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:32,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 22:13:32,352 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:32,353 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 11 treesize of output 3 [2023-02-15 22:13:32,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:33,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:33,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:33,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:33,788 INFO L321 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2023-02-15 22:13:33,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 36 [2023-02-15 22:13:33,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:33,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:33,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:33,812 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-02-15 22:13:33,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 43 [2023-02-15 22:13:33,819 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 10 treesize of output 9 [2023-02-15 22:13:33,826 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 0 case distinctions, treesize of input 28 treesize of output 23 [2023-02-15 22:13:33,834 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 12 treesize of output 11 [2023-02-15 22:13:33,847 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 0 case distinctions, treesize of input 25 treesize of output 20 [2023-02-15 22:13:33,870 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 0 case distinctions, treesize of input 18 treesize of output 15 [2023-02-15 22:13:34,271 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2023-02-15 22:13:34,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 99 treesize of output 79 [2023-02-15 22:13:34,312 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2023-02-15 22:13:34,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 113 treesize of output 98 [2023-02-15 22:13:34,502 INFO L321 Elim1Store]: treesize reduction 33, result has 19.5 percent of original size [2023-02-15 22:13:34,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 95 treesize of output 62 [2023-02-15 22:13:34,511 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2023-02-15 22:13:34,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 41 [2023-02-15 22:13:34,516 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 31 treesize of output 27 [2023-02-15 22:13:35,027 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_3126 (Array Int Int)) (v_ArrVal_3127 (Array Int Int)) (v_ArrVal_3128 (Array Int Int)) (v_ArrVal_3129 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3127) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3129)) (= 0 (select |c_old(#valid)| |chain_node_~node~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3126) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3128)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:13:35,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:35,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:35,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:35,111 INFO L321 Elim1Store]: treesize reduction 74, result has 35.1 percent of original size [2023-02-15 22:13:35,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 104 treesize of output 125 [2023-02-15 22:13:35,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:35,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:35,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:35,162 INFO L321 Elim1Store]: treesize reduction 94, result has 30.9 percent of original size [2023-02-15 22:13:35,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 102 treesize of output 124 [2023-02-15 22:13:35,180 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-02-15 22:13:35,180 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 69 treesize of output 65 [2023-02-15 22:13:35,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 72 [2023-02-15 22:13:35,340 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 66 treesize of output 60 [2023-02-15 22:13:35,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:36,241 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-02-15 22:13:36,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 22:13:36,712 INFO L321 Elim1Store]: treesize reduction 33, result has 8.3 percent of original size [2023-02-15 22:13:36,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 86 treesize of output 48 [2023-02-15 22:13:36,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:36,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:36,721 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:13:36,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 22 [2023-02-15 22:13:36,847 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-02-15 22:13:36,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:13:37,345 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:37,345 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 19 treesize of output 15 [2023-02-15 22:13:37,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238126369] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:37,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:13:37,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 69 [2023-02-15 22:13:37,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918313278] [2023-02-15 22:13:37,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:13:37,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-02-15 22:13:37,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:37,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-02-15 22:13:37,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=5632, Unknown=8, NotChecked=150, Total=6006 [2023-02-15 22:13:37,748 INFO L87 Difference]: Start difference. First operand 196 states and 223 transitions. Second operand has 69 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:13:53,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:53,843 INFO L93 Difference]: Finished difference Result 454 states and 520 transitions. [2023-02-15 22:13:53,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-02-15 22:13:53,843 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 71 [2023-02-15 22:13:53,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:53,846 INFO L225 Difference]: With dead ends: 454 [2023-02-15 22:13:53,846 INFO L226 Difference]: Without dead ends: 454 [2023-02-15 22:13:53,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 125 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3426 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=981, Invalid=14753, Unknown=20, NotChecked=248, Total=16002 [2023-02-15 22:13:53,849 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 679 mSDsluCounter, 3213 mSDsCounter, 0 mSdLazyCounter, 7327 mSolverCounterSat, 182 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 3309 SdHoareTripleChecker+Invalid, 7872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 7327 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:53,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 3309 Invalid, 7872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 7327 Invalid, 17 Unknown, 346 Unchecked, 7.7s Time] [2023-02-15 22:13:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-02-15 22:13:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 250. [2023-02-15 22:13:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 185 states have (on average 1.3621621621621622) internal successors, (252), 229 states have internal predecessors, (252), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 22:13:53,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 290 transitions. [2023-02-15 22:13:53,855 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 290 transitions. Word has length 71 [2023-02-15 22:13:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:53,856 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 290 transitions. [2023-02-15 22:13:53,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 64 states have internal predecessors, (127), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 22:13:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 290 transitions. [2023-02-15 22:13:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-15 22:13:53,857 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:53,857 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:53,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 22:13:54,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:54,066 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:13:54,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1637749689, now seen corresponding path program 1 times [2023-02-15 22:13:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:54,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677080555] [2023-02-15 22:13:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:54,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:13:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:13:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:54,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:13:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-02-15 22:13:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:54,185 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-02-15 22:13:54,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:54,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677080555] [2023-02-15 22:13:54,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677080555] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:13:54,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:13:54,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 22:13:54,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539787200] [2023-02-15 22:13:54,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:13:54,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:13:54,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:13:54,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:13:54,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:13:54,187 INFO L87 Difference]: Start difference. First operand 250 states and 290 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:13:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:13:54,531 INFO L93 Difference]: Finished difference Result 315 states and 364 transitions. [2023-02-15 22:13:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:13:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 73 [2023-02-15 22:13:54,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:13:54,532 INFO L225 Difference]: With dead ends: 315 [2023-02-15 22:13:54,532 INFO L226 Difference]: Without dead ends: 315 [2023-02-15 22:13:54,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-02-15 22:13:54,533 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 135 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:13:54,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 551 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:13:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-02-15 22:13:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 249. [2023-02-15 22:13:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 185 states have (on average 1.3567567567567567) internal successors, (251), 228 states have internal predecessors, (251), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 22:13:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 289 transitions. [2023-02-15 22:13:54,537 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 289 transitions. Word has length 73 [2023-02-15 22:13:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:13:54,537 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 289 transitions. [2023-02-15 22:13:54,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:13:54,537 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 289 transitions. [2023-02-15 22:13:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-15 22:13:54,538 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:13:54,538 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:13:54,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 22:13:54,538 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:13:54,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:13:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1637749690, now seen corresponding path program 1 times [2023-02-15 22:13:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:13:54,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323892443] [2023-02-15 22:13:54,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:54,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:13:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:13:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:55,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:13:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:13:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:56,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-02-15 22:13:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:56,634 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 22:13:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:13:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323892443] [2023-02-15 22:13:56,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323892443] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:13:56,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357904997] [2023-02-15 22:13:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:13:56,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:13:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:13:56,636 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:13:56,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 22:13:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:13:56,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 110 conjunts are in the unsatisfiable core [2023-02-15 22:13:56,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:13:56,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:57,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:57,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:13:57,238 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:13:57,238 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 25 treesize of output 20 [2023-02-15 22:13:57,251 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:13:57,251 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 23 treesize of output 18 [2023-02-15 22:13:57,313 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:57,313 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 21 treesize of output 9 [2023-02-15 22:13:57,318 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:13:57,318 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 15 treesize of output 7 [2023-02-15 22:13:57,706 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_3622 (Array Int Int)) (v_ArrVal_3623 (Array Int Int)) (v_ArrVal_3624 (Array Int Int)) (v_ArrVal_3625 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_3623) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3625)) (= |c_#length| (store |c_old(#length)| |chain_node_~node~0#1.base| 8)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_3622) |c_chain_node_#in~ppnode#1.base| v_ArrVal_3624)))) is different from true [2023-02-15 22:13:57,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:57,747 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 22:13:57,747 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 30 treesize of output 46 [2023-02-15 22:13:57,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:13:57,771 INFO L321 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2023-02-15 22:13:57,771 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 24 treesize of output 42 [2023-02-15 22:13:57,781 INFO L321 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2023-02-15 22:13:57,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 22:13:57,791 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 15 treesize of output 11 [2023-02-15 22:13:57,798 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 7 treesize of output 5 [2023-02-15 22:13:57,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:13:57,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:13:58,044 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:13:58,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:13:58,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:13:58,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 22:13:58,538 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 22:13:58,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:09,308 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:14:09,403 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 22:14:09,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357904997] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:09,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:14:09,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2023-02-15 22:14:09,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938806977] [2023-02-15 22:14:09,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:09,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-15 22:14:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:09,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-15 22:14:09,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2427, Unknown=39, NotChecked=100, Total=2756 [2023-02-15 22:14:09,674 INFO L87 Difference]: Start difference. First operand 249 states and 289 transitions. Second operand has 45 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 42 states have internal predecessors, (118), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:14:14,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:14,747 INFO L93 Difference]: Finished difference Result 367 states and 421 transitions. [2023-02-15 22:14:14,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 22:14:14,747 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 42 states have internal predecessors, (118), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 73 [2023-02-15 22:14:14,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:14,749 INFO L225 Difference]: With dead ends: 367 [2023-02-15 22:14:14,749 INFO L226 Difference]: Without dead ends: 367 [2023-02-15 22:14:14,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1212 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=462, Invalid=4895, Unknown=49, NotChecked=144, Total=5550 [2023-02-15 22:14:14,750 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 755 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 4242 mSolverCounterSat, 104 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 4585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 4242 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:14,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1749 Invalid, 4585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 4242 Invalid, 8 Unknown, 231 Unchecked, 3.0s Time] [2023-02-15 22:14:14,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-02-15 22:14:14,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 248. [2023-02-15 22:14:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 185 states have (on average 1.3513513513513513) internal successors, (250), 227 states have internal predecessors, (250), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 22:14:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2023-02-15 22:14:14,755 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 73 [2023-02-15 22:14:14,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:14,755 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2023-02-15 22:14:14,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.6818181818181817) internal successors, (118), 42 states have internal predecessors, (118), 6 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2023-02-15 22:14:14,756 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2023-02-15 22:14:14,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-02-15 22:14:14,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:14,756 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:14,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-15 22:14:14,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-15 22:14:14,963 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:14:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:14,963 INFO L85 PathProgramCache]: Analyzing trace with hash 633934672, now seen corresponding path program 1 times [2023-02-15 22:14:14,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:14,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197698753] [2023-02-15 22:14:14,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:14,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:14,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:14:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:14:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:14:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:15,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-15 22:14:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:15,315 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 44 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-02-15 22:14:15,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:15,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197698753] [2023-02-15 22:14:15,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197698753] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:15,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172933901] [2023-02-15 22:14:15,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:15,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:15,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:15,317 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:14:15,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 22:14:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:15,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 22:14:15,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:15,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:15,596 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:14:15,596 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 22:14:15,600 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 22:14:15,627 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 22:14:15,641 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4009 Int)) (= |c_#length| (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_4009))))) is different from true [2023-02-15 22:14:15,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:15,674 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 22:14:15,713 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 22:14:15,718 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4010 Int)) (= |c_#length| (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_4010))))) is different from true [2023-02-15 22:14:15,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:15,757 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 22:14:15,797 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 22:14:15,804 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (exists ((v_ArrVal_4011 Int)) (= |c_#length| (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_4011))) (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:14:15,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:15,842 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 22:14:15,865 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 22:14:15,876 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_alloc_node_~ptr~0#1.base| Int)) (and (< |chain_node_alloc_node_~ptr~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4012 Int)) (= |c_#length| (store |c_old(#length)| |chain_node_alloc_node_~ptr~0#1.base| v_ArrVal_4012))))) is different from true [2023-02-15 22:14:15,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:15,907 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 22:14:15,947 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 66 not checked. [2023-02-15 22:14:15,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:16,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172933901] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:16,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:14:16,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2023-02-15 22:14:16,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64185341] [2023-02-15 22:14:16,073 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:16,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 22:14:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:16,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 22:14:16,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=221, Unknown=4, NotChecked=132, Total=420 [2023-02-15 22:14:16,073 INFO L87 Difference]: Start difference. First operand 248 states and 288 transitions. Second operand has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 16 states have internal predecessors, (114), 4 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 22:14:16,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:16,531 INFO L93 Difference]: Finished difference Result 260 states and 301 transitions. [2023-02-15 22:14:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:14:16,531 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 16 states have internal predecessors, (114), 4 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2023-02-15 22:14:16,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:16,532 INFO L225 Difference]: With dead ends: 260 [2023-02-15 22:14:16,532 INFO L226 Difference]: Without dead ends: 260 [2023-02-15 22:14:16,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=362, Unknown=4, NotChecked=172, Total=650 [2023-02-15 22:14:16,533 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 488 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 784 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:16,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 301 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 748 Invalid, 0 Unknown, 784 Unchecked, 0.4s Time] [2023-02-15 22:14:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-15 22:14:16,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 242. [2023-02-15 22:14:16,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 180 states have (on average 1.35) internal successors, (243), 221 states have internal predecessors, (243), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2023-02-15 22:14:16,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 281 transitions. [2023-02-15 22:14:16,542 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 281 transitions. Word has length 73 [2023-02-15 22:14:16,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:16,542 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 281 transitions. [2023-02-15 22:14:16,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.705882352941177) internal successors, (114), 16 states have internal predecessors, (114), 4 states have call successors, (7), 2 states have call predecessors, (7), 7 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-15 22:14:16,542 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 281 transitions. [2023-02-15 22:14:16,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 22:14:16,543 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:16,543 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:16,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 22:14:16,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 22:14:16,745 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:14:16,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash -627255358, now seen corresponding path program 1 times [2023-02-15 22:14:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:16,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131065588] [2023-02-15 22:14:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:14:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:14:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:18,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:14:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:19,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-02-15 22:14:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:19,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:14:19,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:19,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131065588] [2023-02-15 22:14:19,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131065588] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:19,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235733357] [2023-02-15 22:14:19,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:19,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:19,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:19,747 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:14:19,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 22:14:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:20,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 111 conjunts are in the unsatisfiable core [2023-02-15 22:14:20,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:20,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:14:20,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:14:20,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 22:14:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:14:20,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:14:20,443 INFO L321 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2023-02-15 22:14:20,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:14:20,461 INFO L321 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2023-02-15 22:14:20,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 30 [2023-02-15 22:14:20,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,814 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:14:20,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 37 [2023-02-15 22:14:20,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,828 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:14:20,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 47 [2023-02-15 22:14:20,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,972 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:14:20,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 27 [2023-02-15 22:14:20,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:20,982 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:14:20,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 13 [2023-02-15 22:14:20,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:14:21,445 WARN L859 $PredicateComparison]: unable to prove that (exists ((|chain_node_~node~0#1.base| Int) (v_ArrVal_4315 (Array Int Int)) (v_ArrVal_4316 (Array Int Int)) (v_ArrVal_4317 (Array Int Int)) (v_ArrVal_4318 (Array Int Int))) (and (= 0 (select |c_old(#valid)| |chain_node_~node~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store (store |c_old(#memory_$Pointer$.offset)| |chain_node_~node~0#1.base| v_ArrVal_4315) |c_chain_node_#in~ppnode#1.base| v_ArrVal_4317)) (= |c_#memory_$Pointer$.base| (store (store |c_old(#memory_$Pointer$.base)| |chain_node_~node~0#1.base| v_ArrVal_4316) |c_chain_node_#in~ppnode#1.base| v_ArrVal_4318)) (< |chain_node_~node~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 22:14:21,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:21,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:21,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:21,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:21,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:21,486 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-02-15 22:14:21,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 61 [2023-02-15 22:14:21,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:21,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:21,533 INFO L321 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2023-02-15 22:14:21,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 84 [2023-02-15 22:14:21,544 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-02-15 22:14:21,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 22:14:21,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2023-02-15 22:14:21,580 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 44 treesize of output 34 [2023-02-15 22:14:21,594 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 37 treesize of output 29 [2023-02-15 22:14:21,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:14:21,868 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:14:22,032 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:14:22,032 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:14:22,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:22,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:22,624 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:22,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 40 [2023-02-15 22:14:22,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:22,631 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 22:14:22,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2023-02-15 22:14:22,636 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 22:14:22,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:14:22,810 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 22:14:23,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235733357] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:23,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:14:23,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 26] total 57 [2023-02-15 22:14:23,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73377032] [2023-02-15 22:14:23,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:14:23,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-02-15 22:14:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:14:23,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-02-15 22:14:23,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3438, Unknown=10, NotChecked=118, Total=3782 [2023-02-15 22:14:23,122 INFO L87 Difference]: Start difference. First operand 242 states and 281 transitions. Second operand has 57 states, 55 states have (on average 2.381818181818182) internal successors, (131), 55 states have internal predecessors, (131), 8 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:14:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:14:31,150 INFO L93 Difference]: Finished difference Result 456 states and 522 transitions. [2023-02-15 22:14:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 22:14:31,150 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 55 states have (on average 2.381818181818182) internal successors, (131), 55 states have internal predecessors, (131), 8 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 76 [2023-02-15 22:14:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:14:31,152 INFO L225 Difference]: With dead ends: 456 [2023-02-15 22:14:31,152 INFO L226 Difference]: Without dead ends: 456 [2023-02-15 22:14:31,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 81 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=719, Invalid=7637, Unknown=20, NotChecked=180, Total=8556 [2023-02-15 22:14:31,153 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 688 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 5012 mSolverCounterSat, 143 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 5436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 5012 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:14:31,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 2406 Invalid, 5436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 5012 Invalid, 15 Unknown, 266 Unchecked, 4.0s Time] [2023-02-15 22:14:31,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-02-15 22:14:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 253. [2023-02-15 22:14:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 190 states have (on average 1.331578947368421) internal successors, (253), 231 states have internal predecessors, (253), 24 states have call successors, (24), 7 states have call predecessors, (24), 6 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2023-02-15 22:14:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 293 transitions. [2023-02-15 22:14:31,159 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 293 transitions. Word has length 76 [2023-02-15 22:14:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:14:31,160 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 293 transitions. [2023-02-15 22:14:31,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 55 states have (on average 2.381818181818182) internal successors, (131), 55 states have internal predecessors, (131), 8 states have call successors, (9), 5 states have call predecessors, (9), 7 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-02-15 22:14:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 293 transitions. [2023-02-15 22:14:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-15 22:14:31,161 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:14:31,161 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:14:31,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 22:14:31,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-15 22:14:31,372 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, check_seq_nextErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, check_seq_nextErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 80 more)] === [2023-02-15 22:14:31,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:14:31,372 INFO L85 PathProgramCache]: Analyzing trace with hash 2029804448, now seen corresponding path program 1 times [2023-02-15 22:14:31,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:14:31,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003106911] [2023-02-15 22:14:31,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:31,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:14:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 22:14:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:32,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-02-15 22:14:32,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:33,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-02-15 22:14:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:34,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-02-15 22:14:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 22:14:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:14:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003106911] [2023-02-15 22:14:34,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003106911] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:14:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245446372] [2023-02-15 22:14:34,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:14:34,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:14:34,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:14:34,892 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:14:34,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 22:14:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:14:35,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 167 conjunts are in the unsatisfiable core [2023-02-15 22:14:35,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:14:35,192 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-02-15 22:14:35,193 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 27 [2023-02-15 22:14:35,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:14:35,589 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:14:35,594 INFO L321 Elim1Store]: treesize reduction 18, result has 30.8 percent of original size [2023-02-15 22:14:35,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 24 [2023-02-15 22:14:35,708 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:14:35,708 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 28 [2023-02-15 22:14:35,711 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 22:14:36,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:14:36,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:36,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:36,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-02-15 22:14:36,488 INFO L321 Elim1Store]: treesize reduction 64, result has 46.7 percent of original size [2023-02-15 22:14:36,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 45 treesize of output 89 [2023-02-15 22:14:36,495 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 0 case distinctions, treesize of input 76 treesize of output 63 [2023-02-15 22:14:36,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-15 22:14:36,980 INFO L321 Elim1Store]: treesize reduction 32, result has 41.8 percent of original size [2023-02-15 22:14:36,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 93 [2023-02-15 22:14:37,050 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:14:37,050 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 23 treesize of output 18 [2023-02-15 22:14:37,323 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-02-15 22:14:37,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 73 [2023-02-15 22:14:37,355 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:14:37,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 122 [2023-02-15 22:14:37,364 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:14:37,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 22:14:38,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:38,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:38,257 INFO L321 Elim1Store]: treesize reduction 56, result has 29.1 percent of original size [2023-02-15 22:14:38,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 121 [2023-02-15 22:14:38,342 INFO L321 Elim1Store]: treesize reduction 186, result has 33.1 percent of original size [2023-02-15 22:14:38,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 99 treesize of output 169 [2023-02-15 22:14:38,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:14:38,369 INFO L321 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2023-02-15 22:14:38,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 40 [2023-02-15 22:14:38,540 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 122 treesize of output 98 [2023-02-15 22:14:38,574 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 113 treesize of output 91 [2023-02-15 22:14:38,756 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 7 treesize of output 5 [2023-02-15 22:14:38,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 22:14:40,146 INFO L321 Elim1Store]: treesize reduction 978, result has 21.6 percent of original size [2023-02-15 22:14:40,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 104 case distinctions, treesize of input 304 treesize of output 528