./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2c_append_unequal.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 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:23:47,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:23:47,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:23:47,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:23:47,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:23:47,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:23:47,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:23:47,723 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:23:47,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:23:47,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:23:47,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:23:47,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:23:47,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:23:47,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:23:47,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:23:47,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:23:47,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:23:47,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:23:47,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:23:47,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:23:47,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:23:47,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:23:47,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:23:47,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:23:47,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:23:47,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:23:47,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:23:47,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:23:47,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:23:47,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:23:47,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:23:47,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:23:47,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:23:47,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:23:47,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:23:47,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:23:47,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:23:47,759 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:23:47,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:23:47,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:23:47,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:23:47,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:23:47,788 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:23:47,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:23:47,788 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:23:47,789 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:23:47,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:23:47,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:23:47,790 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:23:47,790 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:23:47,790 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:23:47,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:23:47,791 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:23:47,791 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:23:47,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:23:47,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:23:47,792 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:23:47,792 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:23:47,792 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:23:47,792 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:23:47,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:23:47,792 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:23:47,792 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:23:47,793 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:23:47,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:23:47,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:23:47,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:23:47,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:23:47,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:23:47,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:23:47,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:23:47,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:23:47,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:23:47,794 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:23:47,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:23:47,795 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:23:47,795 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 -> 9aabbeff87ba819b44dc608a3105d0ba81b71cd88693ecf2e6bf3860a7863e64 [2023-02-15 13:23:48,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:23:48,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:23:48,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:23:48,159 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:23:48,160 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:23:48,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-02-15 13:23:49,124 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:23:49,373 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:23:49,374 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i [2023-02-15 13:23:49,384 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e39cbc9f/b9e0e7fa6b1c4a0ca99c24950f536a2f/FLAGba25cdd36 [2023-02-15 13:23:49,393 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e39cbc9f/b9e0e7fa6b1c4a0ca99c24950f536a2f [2023-02-15 13:23:49,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:23:49,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:23:49,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:23:49,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:23:49,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:23:49,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@592790f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49, skipping insertion in model container [2023-02-15 13:23:49,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:23:49,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:23:49,606 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2023-02-15 13:23:49,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:23:49,625 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:23:49,654 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_append_unequal.i[24672,24685] [2023-02-15 13:23:49,655 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:23:49,673 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:23:49,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49 WrapperNode [2023-02-15 13:23:49,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:23:49,674 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:23:49,674 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:23:49,674 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:23:49,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,712 INFO L138 Inliner]: procedures = 127, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2023-02-15 13:23:49,712 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:23:49,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:23:49,713 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:23:49,713 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:23:49,718 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,721 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,730 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,733 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:23:49,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:23:49,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:23:49,734 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:23:49,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (1/1) ... [2023-02-15 13:23:49,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:23:49,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:23:49,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:23:49,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:23:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:23:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:23:49,812 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-15 13:23:49,813 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:23:49,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:23:49,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:23:49,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:23:49,953 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:23:49,958 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:23:50,295 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:23:50,300 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:23:50,301 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 13:23:50,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:23:50 BoogieIcfgContainer [2023-02-15 13:23:50,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:23:50,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:23:50,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:23:50,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:23:50,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:23:49" (1/3) ... [2023-02-15 13:23:50,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3257429d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:23:50, skipping insertion in model container [2023-02-15 13:23:50,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:23:49" (2/3) ... [2023-02-15 13:23:50,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3257429d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:23:50, skipping insertion in model container [2023-02-15 13:23:50,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:23:50" (3/3) ... [2023-02-15 13:23:50,309 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_append_unequal.i [2023-02-15 13:23:50,321 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:23:50,321 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-02-15 13:23:50,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:23:50,361 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;@120bfb2c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:23:50,361 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2023-02-15 13:23:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:23:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:23:50,370 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:50,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:23:50,371 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:50,375 INFO L85 PathProgramCache]: Analyzing trace with hash 895672562, now seen corresponding path program 1 times [2023-02-15 13:23:50,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:50,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114130123] [2023-02-15 13:23:50,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:50,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:23:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114130123] [2023-02-15 13:23:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114130123] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:23:50,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:23:50,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:23:50,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753312945] [2023-02-15 13:23:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:23:50,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:23:50,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:50,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:23:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:23:50,556 INFO L87 Difference]: Start difference. First operand has 138 states, 69 states have (on average 2.1159420289855073) internal successors, (146), 133 states have internal predecessors, (146), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:23:50,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:50,649 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2023-02-15 13:23:50,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:23:50,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:23:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:50,657 INFO L225 Difference]: With dead ends: 135 [2023-02-15 13:23:50,657 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 13:23:50,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:23:50,661 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:50,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 207 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:23:50,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 13:23:50,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-02-15 13:23:50,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 67 states have (on average 2.014925373134328) internal successors, (135), 127 states have internal predecessors, (135), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:23:50,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2023-02-15 13:23:50,689 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 6 [2023-02-15 13:23:50,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:50,690 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2023-02-15 13:23:50,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:23:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2023-02-15 13:23:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 13:23:50,691 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:50,691 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 13:23:50,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:23:50,691 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:50,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:50,692 INFO L85 PathProgramCache]: Analyzing trace with hash 895672563, now seen corresponding path program 1 times [2023-02-15 13:23:50,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:50,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504582801] [2023-02-15 13:23:50,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:50,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:23:50,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504582801] [2023-02-15 13:23:50,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504582801] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:23:50,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:23:50,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:23:50,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965287498] [2023-02-15 13:23:50,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:23:50,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:23:50,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:50,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:23:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:23:50,799 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:23:50,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:50,864 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2023-02-15 13:23:50,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:23:50,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 13:23:50,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:50,865 INFO L225 Difference]: With dead ends: 129 [2023-02-15 13:23:50,865 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 13:23:50,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:23:50,870 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:50,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 209 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:23:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 13:23:50,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-02-15 13:23:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 67 states have (on average 1.9701492537313432) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:23:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2023-02-15 13:23:50,877 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 6 [2023-02-15 13:23:50,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:50,877 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2023-02-15 13:23:50,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:23:50,877 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2023-02-15 13:23:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:23:50,878 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:50,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:23:50,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:23:50,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash -753542016, now seen corresponding path program 1 times [2023-02-15 13:23:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:50,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515873610] [2023-02-15 13:23:50,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:50,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:23:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:23:50,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515873610] [2023-02-15 13:23:50,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515873610] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:23:50,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:23:50,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:23:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008278863] [2023-02-15 13:23:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:23:50,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:23:50,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:50,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:23:50,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:23:50,968 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:23:51,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:51,060 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2023-02-15 13:23:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:23:51,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-02-15 13:23:51,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:51,064 INFO L225 Difference]: With dead ends: 140 [2023-02-15 13:23:51,065 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 13:23:51,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:23:51,070 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 10 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:51,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 313 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:23:51,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 13:23:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 130. [2023-02-15 13:23:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 1.9558823529411764) internal successors, (133), 125 states have internal predecessors, (133), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:23:51,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2023-02-15 13:23:51,090 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 14 [2023-02-15 13:23:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:51,090 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2023-02-15 13:23:51,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:23:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2023-02-15 13:23:51,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:23:51,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:51,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:23:51,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:23:51,092 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:51,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:51,093 INFO L85 PathProgramCache]: Analyzing trace with hash 265974304, now seen corresponding path program 1 times [2023-02-15 13:23:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:51,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089412406] [2023-02-15 13:23:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:51,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:23:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:51,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:23:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:51,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:23:51,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:51,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089412406] [2023-02-15 13:23:51,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089412406] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:23:51,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:23:51,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:23:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956308012] [2023-02-15 13:23:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:23:51,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:23:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:23:51,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:23:51,316 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:23:51,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:51,530 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2023-02-15 13:23:51,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:23:51,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 13:23:51,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:51,533 INFO L225 Difference]: With dead ends: 130 [2023-02-15 13:23:51,533 INFO L226 Difference]: Without dead ends: 130 [2023-02-15 13:23:51,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:23:51,540 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:51,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 426 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:23:51,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-15 13:23:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2023-02-15 13:23:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 68 states have (on average 1.9411764705882353) internal successors, (132), 124 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:23:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2023-02-15 13:23:51,553 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 24 [2023-02-15 13:23:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:51,554 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2023-02-15 13:23:51,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:23:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2023-02-15 13:23:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:23:51,554 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:51,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:23:51,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:23:51,555 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:51,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:51,555 INFO L85 PathProgramCache]: Analyzing trace with hash 265974305, now seen corresponding path program 1 times [2023-02-15 13:23:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:51,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214095817] [2023-02-15 13:23:51,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:51,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:51,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:23:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:51,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:23:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:23:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:51,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214095817] [2023-02-15 13:23:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214095817] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:23:51,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:23:51,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:23:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818654658] [2023-02-15 13:23:51,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:23:51,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:23:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:51,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:23:51,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:23:51,801 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:23:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:51,992 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2023-02-15 13:23:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:23:51,992 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-15 13:23:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:51,993 INFO L225 Difference]: With dead ends: 129 [2023-02-15 13:23:51,995 INFO L226 Difference]: Without dead ends: 129 [2023-02-15 13:23:51,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:23:51,996 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 19 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:51,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 450 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:23:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-02-15 13:23:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2023-02-15 13:23:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 68 states have (on average 1.9264705882352942) internal successors, (131), 123 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:23:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 137 transitions. [2023-02-15 13:23:52,000 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 137 transitions. Word has length 24 [2023-02-15 13:23:52,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:52,000 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 137 transitions. [2023-02-15 13:23:52,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:23:52,000 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 137 transitions. [2023-02-15 13:23:52,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:23:52,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:52,001 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:23:52,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:23:52,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:52,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731903, now seen corresponding path program 1 times [2023-02-15 13:23:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:52,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132820935] [2023-02-15 13:23:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:52,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:23:52,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:52,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:23:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:23:52,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132820935] [2023-02-15 13:23:52,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132820935] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:23:52,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032022776] [2023-02-15 13:23:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:52,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:23:52,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:23:52,299 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:23:52,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:23:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:52,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:23:52,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:23:52,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:23:52,523 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:23:52,602 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:23:52,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:23:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 13:23:52,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:23:52,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032022776] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:23:52,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:23:52,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-15 13:23:52,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970657353] [2023-02-15 13:23:52,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:23:52,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:23:52,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:52,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:23:52,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-15 13:23:52,686 INFO L87 Difference]: Start difference. First operand 128 states and 137 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:23:52,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:52,954 INFO L93 Difference]: Finished difference Result 153 states and 165 transitions. [2023-02-15 13:23:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:23:52,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2023-02-15 13:23:52,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:52,955 INFO L225 Difference]: With dead ends: 153 [2023-02-15 13:23:52,955 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 13:23:52,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-15 13:23:52,956 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 107 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:52,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 404 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 453 Invalid, 0 Unknown, 158 Unchecked, 0.2s Time] [2023-02-15 13:23:52,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 13:23:52,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2023-02-15 13:23:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 127 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:23:52,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-15 13:23:52,960 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 26 [2023-02-15 13:23:52,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:52,960 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-15 13:23:52,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:23:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-15 13:23:52,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:23:52,961 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:52,961 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:23:52,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 13:23:53,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-02-15 13:23:53,166 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:53,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:53,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2096731902, now seen corresponding path program 1 times [2023-02-15 13:23:53,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:53,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516432128] [2023-02-15 13:23:53,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:53,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:53,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:23:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:23:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:53,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:23:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:53,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516432128] [2023-02-15 13:23:53,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516432128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:23:53,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617855934] [2023-02-15 13:23:53,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:53,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:23:53,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:23:53,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:23:53,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:23:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:53,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 13:23:53,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:23:53,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:23:53,924 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:23:53,924 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 20 [2023-02-15 13:23:53,935 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:23:53,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:23:53,990 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:23:53,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:23:58,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617855934] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:23:58,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:23:58,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2023-02-15 13:23:58,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913165173] [2023-02-15 13:23:58,137 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:23:58,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:23:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:58,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:23:58,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:23:58,138 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:23:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:58,774 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2023-02-15 13:23:58,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:23:58,774 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2023-02-15 13:23:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:58,775 INFO L225 Difference]: With dead ends: 135 [2023-02-15 13:23:58,775 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 13:23:58,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2023-02-15 13:23:58,776 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 15 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:58,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 976 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1049 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:23:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 13:23:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2023-02-15 13:23:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.8888888888888888) internal successors, (136), 127 states have internal predecessors, (136), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:23:58,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2023-02-15 13:23:58,779 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 26 [2023-02-15 13:23:58,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:58,779 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2023-02-15 13:23:58,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 14 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 13:23:58,779 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2023-02-15 13:23:58,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:23:58,780 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:58,780 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:23:58,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-15 13:23:58,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-02-15 13:23:58,981 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:58,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash -619542825, now seen corresponding path program 1 times [2023-02-15 13:23:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:58,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821229473] [2023-02-15 13:23:58,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:23:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:23:59,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:23:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:59,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821229473] [2023-02-15 13:23:59,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821229473] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:23:59,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961404574] [2023-02-15 13:23:59,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:59,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:23:59,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:23:59,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 13:23:59,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:23:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 13:23:59,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:23:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:23:59,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:23:59,356 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:23:59,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961404574] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:23:59,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:23:59,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-15 13:23:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153753916] [2023-02-15 13:23:59,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:23:59,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:23:59,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:59,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:23:59,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:23:59,358 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:23:59,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:23:59,507 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2023-02-15 13:23:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:23:59,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2023-02-15 13:23:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:23:59,510 INFO L225 Difference]: With dead ends: 134 [2023-02-15 13:23:59,510 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:23:59,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:23:59,511 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:23:59,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 660 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:23:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:23:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-02-15 13:23:59,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 72 states have (on average 1.875) internal successors, (135), 127 states have internal predecessors, (135), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:23:59,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2023-02-15 13:23:59,515 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 28 [2023-02-15 13:23:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:23:59,515 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2023-02-15 13:23:59,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:23:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2023-02-15 13:23:59,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:23:59,517 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:23:59,518 INFO L195 NwaCegarLoop]: trace histogram [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 13:23:59,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-15 13:23:59,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:23:59,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:23:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:23:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739054, now seen corresponding path program 1 times [2023-02-15 13:23:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:23:59,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346042407] [2023-02-15 13:23:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:23:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:23:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:23:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:23:59,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:23:59,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346042407] [2023-02-15 13:23:59,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346042407] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:23:59,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274251247] [2023-02-15 13:23:59,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:23:59,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:23:59,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:23:59,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:23:59,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:23:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:23:59,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 13:23:59,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:23:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:23:59,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:23:59,916 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:23:59,916 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 12 treesize of output 11 [2023-02-15 13:23:59,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:23:59,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274251247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:23:59,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:23:59,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-15 13:23:59,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898907011] [2023-02-15 13:23:59,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:23:59,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:23:59,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:23:59,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:23:59,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:23:59,931 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:00,064 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2023-02-15 13:24:00,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:24:00,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-15 13:24:00,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:00,065 INFO L225 Difference]: With dead ends: 138 [2023-02-15 13:24:00,065 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 13:24:00,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:24:00,065 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 11 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:00,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 429 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:24:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 13:24:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2023-02-15 13:24:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8666666666666667) internal successors, (140), 130 states have internal predecessors, (140), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:24:00,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-02-15 13:24:00,068 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 29 [2023-02-15 13:24:00,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:00,068 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-02-15 13:24:00,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:00,068 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-02-15 13:24:00,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:24:00,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:00,069 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:00,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:00,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:00,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:00,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:00,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2030739053, now seen corresponding path program 1 times [2023-02-15 13:24:00,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:00,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701074965] [2023-02-15 13:24:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:00,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:00,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:00,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:24:00,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701074965] [2023-02-15 13:24:00,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701074965] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:00,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916518477] [2023-02-15 13:24:00,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:00,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:00,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:00,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:00,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:24:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:00,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:24:00,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:24:00,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:00,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:24:00,706 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 20 treesize of output 24 [2023-02-15 13:24:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:24:00,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916518477] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:24:00,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:24:00,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2023-02-15 13:24:00,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500547689] [2023-02-15 13:24:00,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:00,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:24:00,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:00,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:24:00,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:24:00,813 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 13:24:01,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:01,078 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2023-02-15 13:24:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:24:01,079 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-15 13:24:01,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:01,080 INFO L225 Difference]: With dead ends: 143 [2023-02-15 13:24:01,080 INFO L226 Difference]: Without dead ends: 143 [2023-02-15 13:24:01,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:24:01,080 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 21 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:01,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1191 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-15 13:24:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2023-02-15 13:24:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 75 states have (on average 1.8533333333333333) internal successors, (139), 130 states have internal predecessors, (139), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:24:01,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2023-02-15 13:24:01,083 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 29 [2023-02-15 13:24:01,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:01,083 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2023-02-15 13:24:01,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-15 13:24:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2023-02-15 13:24:01,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:24:01,084 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:01,084 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:24:01,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:01,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-02-15 13:24:01,292 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:01,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598771, now seen corresponding path program 1 times [2023-02-15 13:24:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565090364] [2023-02-15 13:24:01,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:01,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:01,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:01,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:01,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565090364] [2023-02-15 13:24:01,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565090364] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:01,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:01,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:24:01,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299734111] [2023-02-15 13:24:01,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:01,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:24:01,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:01,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:24:01,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:24:01,391 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:24:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:01,595 INFO L93 Difference]: Finished difference Result 136 states and 147 transitions. [2023-02-15 13:24:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:24:01,596 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 13:24:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:01,596 INFO L225 Difference]: With dead ends: 136 [2023-02-15 13:24:01,597 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 13:24:01,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:24:01,597 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 24 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:01,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 475 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:01,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 13:24:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2023-02-15 13:24:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 75 states have (on average 1.84) internal successors, (138), 129 states have internal predecessors, (138), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:24:01,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2023-02-15 13:24:01,599 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 30 [2023-02-15 13:24:01,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:01,599 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2023-02-15 13:24:01,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:24:01,600 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2023-02-15 13:24:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:24:01,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:01,600 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:24:01,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:24:01,600 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:01,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:01,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1471598772, now seen corresponding path program 1 times [2023-02-15 13:24:01,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:01,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626865687] [2023-02-15 13:24:01,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:01,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:01,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:01,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:01,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:01,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:24:01,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:01,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626865687] [2023-02-15 13:24:01,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626865687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:01,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:01,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:24:01,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630263070] [2023-02-15 13:24:01,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:01,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:24:01,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:24:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:24:01,762 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:24:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:01,973 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2023-02-15 13:24:01,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:24:01,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2023-02-15 13:24:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:01,974 INFO L225 Difference]: With dead ends: 134 [2023-02-15 13:24:01,974 INFO L226 Difference]: Without dead ends: 134 [2023-02-15 13:24:01,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:24:01,974 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 20 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:01,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 505 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:01,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-15 13:24:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-15 13:24:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.8266666666666667) internal successors, (137), 128 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 13:24:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2023-02-15 13:24:01,977 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 30 [2023-02-15 13:24:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:01,977 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2023-02-15 13:24:01,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 13:24:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2023-02-15 13:24:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 13:24:01,977 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:01,977 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:24:01,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:24:01,978 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:01,978 INFO L85 PathProgramCache]: Analyzing trace with hash 939320083, now seen corresponding path program 1 times [2023-02-15 13:24:01,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:01,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266000021] [2023-02-15 13:24:01,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-15 13:24:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 13:24:02,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:02,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266000021] [2023-02-15 13:24:02,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266000021] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:02,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428042294] [2023-02-15 13:24:02,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:02,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:02,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:02,057 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:02,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:24:02,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:24:02,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 13:24:02,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:24:02,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428042294] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:02,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:24:02,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-15 13:24:02,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523685790] [2023-02-15 13:24:02,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:02,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:24:02,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:02,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:24:02,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:24:02,211 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:02,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:02,232 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2023-02-15 13:24:02,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:24:02,233 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2023-02-15 13:24:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:02,233 INFO L225 Difference]: With dead ends: 122 [2023-02-15 13:24:02,233 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 13:24:02,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:24:02,234 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 107 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:02,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:24:02,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 13:24:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-15 13:24:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 117 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2023-02-15 13:24:02,236 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 41 [2023-02-15 13:24:02,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:02,237 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2023-02-15 13:24:02,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2023-02-15 13:24:02,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:24:02,237 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:02,238 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:02,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:02,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:02,443 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:02,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -566913869, now seen corresponding path program 1 times [2023-02-15 13:24:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:02,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194102825] [2023-02-15 13:24:02,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:02,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-15 13:24:02,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:02,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194102825] [2023-02-15 13:24:02,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194102825] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:02,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344625832] [2023-02-15 13:24:02,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:02,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:02,825 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:02,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:24:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:02,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-15 13:24:02,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:03,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:03,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:03,022 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1582))))) is different from true [2023-02-15 13:24:03,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:03,050 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:24:03,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:03,065 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-15 13:24:03,081 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:24:03,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:24:03,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:03,137 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1584 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1584))))) is different from true [2023-02-15 13:24:03,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:03,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:24:03,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-15 13:24:03,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:03,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344625832] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:03,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:03,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-02-15 13:24:03,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806658265] [2023-02-15 13:24:03,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:03,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:24:03,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:03,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:24:03,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=125, Unknown=3, NotChecked=72, Total=240 [2023-02-15 13:24:03,221 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:24:03,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:03,565 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2023-02-15 13:24:03,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:24:03,566 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-15 13:24:03,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:03,568 INFO L225 Difference]: With dead ends: 132 [2023-02-15 13:24:03,568 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 13:24:03,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=166, Unknown=3, NotChecked=84, Total=306 [2023-02-15 13:24:03,569 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 185 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:03,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 262 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 357 Invalid, 0 Unknown, 342 Unchecked, 0.3s Time] [2023-02-15 13:24:03,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 13:24:03,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2023-02-15 13:24:03,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 109 states have internal predecessors, (115), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:03,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2023-02-15 13:24:03,571 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 43 [2023-02-15 13:24:03,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:03,572 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2023-02-15 13:24:03,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:24:03,573 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2023-02-15 13:24:03,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:24:03,574 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:03,574 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:03,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:03,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:03,780 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:03,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:03,781 INFO L85 PathProgramCache]: Analyzing trace with hash -566913868, now seen corresponding path program 1 times [2023-02-15 13:24:03,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:03,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873219649] [2023-02-15 13:24:03,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:03,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:04,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:04,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 13:24:04,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:04,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873219649] [2023-02-15 13:24:04,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873219649] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:04,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850018655] [2023-02-15 13:24:04,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:04,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:04,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:04,174 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:04,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:24:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:04,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:24:04,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:04,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:04,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:04,355 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1821 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1821) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:24:04,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:04,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:24:04,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 5 treesize of output 3 [2023-02-15 13:24:04,392 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2023-02-15 13:24:04,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:04,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:24:04,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:04,455 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-15 13:24:04,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:04,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:24:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-15 13:24:04,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:04,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850018655] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:04,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:04,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2023-02-15 13:24:04,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526911329] [2023-02-15 13:24:04,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:04,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 13:24:04,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:04,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 13:24:04,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=147, Unknown=3, NotChecked=78, Total=272 [2023-02-15 13:24:04,553 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:24:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:04,913 INFO L93 Difference]: Finished difference Result 124 states and 132 transitions. [2023-02-15 13:24:04,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:24:04,914 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2023-02-15 13:24:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:04,914 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:24:04,914 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 13:24:04,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=215, Unknown=3, NotChecked=96, Total=380 [2023-02-15 13:24:04,915 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 260 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 375 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:04,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 303 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 474 Invalid, 0 Unknown, 375 Unchecked, 0.3s Time] [2023-02-15 13:24:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 13:24:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2023-02-15 13:24:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.5735294117647058) internal successors, (107), 101 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:04,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2023-02-15 13:24:04,917 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 43 [2023-02-15 13:24:04,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:04,917 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2023-02-15 13:24:04,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.333333333333333) internal successors, (52), 13 states have internal predecessors, (52), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-15 13:24:04,917 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2023-02-15 13:24:04,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:24:04,917 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:04,917 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:04,923 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 13:24:05,123 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,SelfDestructingSolverStorable14 [2023-02-15 13:24:05,123 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:05,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:05,124 INFO L85 PathProgramCache]: Analyzing trace with hash 656619060, now seen corresponding path program 1 times [2023-02-15 13:24:05,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:05,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923202842] [2023-02-15 13:24:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:05,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:24:05,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:05,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923202842] [2023-02-15 13:24:05,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923202842] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:05,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:05,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:24:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763324362] [2023-02-15 13:24:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:05,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:24:05,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:24:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:24:05,218 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:05,357 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2023-02-15 13:24:05,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:24:05,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-15 13:24:05,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:05,358 INFO L225 Difference]: With dead ends: 120 [2023-02-15 13:24:05,358 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 13:24:05,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:24:05,359 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:05,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 282 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:24:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 13:24:05,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2023-02-15 13:24:05,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 68 states have (on average 1.5147058823529411) internal successors, (103), 97 states have internal predecessors, (103), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2023-02-15 13:24:05,361 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 45 [2023-02-15 13:24:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:05,361 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2023-02-15 13:24:05,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2023-02-15 13:24:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:24:05,361 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:05,361 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:05,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:24:05,361 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:05,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash 656619061, now seen corresponding path program 1 times [2023-02-15 13:24:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:05,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051287603] [2023-02-15 13:24:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:05,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:05,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 13:24:05,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:05,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051287603] [2023-02-15 13:24:05,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051287603] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:05,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:05,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:24:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997784965] [2023-02-15 13:24:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:05,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:24:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:24:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:24:05,511 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:05,677 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2023-02-15 13:24:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:24:05,677 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-15 13:24:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:05,678 INFO L225 Difference]: With dead ends: 98 [2023-02-15 13:24:05,678 INFO L226 Difference]: Without dead ends: 98 [2023-02-15 13:24:05,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:24:05,678 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 77 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:05,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 293 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:05,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-15 13:24:05,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-02-15 13:24:05,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 93 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:05,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-02-15 13:24:05,680 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 45 [2023-02-15 13:24:05,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:05,680 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-02-15 13:24:05,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:05,680 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-02-15 13:24:05,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:24:05,680 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:05,681 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:05,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:24:05,681 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:05,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:05,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634675, now seen corresponding path program 1 times [2023-02-15 13:24:05,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:05,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002411455] [2023-02-15 13:24:05,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:05,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:05,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:06,163 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 13:24:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:06,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002411455] [2023-02-15 13:24:06,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002411455] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:06,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786254142] [2023-02-15 13:24:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:06,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:06,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:06,173 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:06,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-15 13:24:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:06,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 13:24:06,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:06,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:06,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-15 13:24:06,658 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2355 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2355))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2023-02-15 13:24:06,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:06,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:24:06,680 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 13:24:06,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:24:06,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 13:24:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 13:24:06,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:06,786 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| Int) (v_ArrVal_2361 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_48| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_48| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_48| v_ArrVal_2361) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) 1))) is different from false [2023-02-15 13:24:06,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786254142] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:06,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:06,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2023-02-15 13:24:06,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670008372] [2023-02-15 13:24:06,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:06,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 13:24:06,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:06,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 13:24:06,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=573, Unknown=3, NotChecked=98, Total=756 [2023-02-15 13:24:06,788 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:24:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:07,225 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2023-02-15 13:24:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:24:07,226 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-15 13:24:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:07,226 INFO L225 Difference]: With dead ends: 115 [2023-02-15 13:24:07,226 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 13:24:07,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=173, Invalid=952, Unknown=5, NotChecked=130, Total=1260 [2023-02-15 13:24:07,227 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 432 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:07,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 476 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 673 Invalid, 3 Unknown, 120 Unchecked, 0.3s Time] [2023-02-15 13:24:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 13:24:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2023-02-15 13:24:07,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.4411764705882353) internal successors, (98), 92 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:07,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2023-02-15 13:24:07,229 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 46 [2023-02-15 13:24:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:07,229 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2023-02-15 13:24:07,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:24:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2023-02-15 13:24:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 13:24:07,229 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:07,229 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:07,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-15 13:24:07,435 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:07,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1119634674, now seen corresponding path program 1 times [2023-02-15 13:24:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104151653] [2023-02-15 13:24:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:07,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:07,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:07,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:08,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:08,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104151653] [2023-02-15 13:24:08,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104151653] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:08,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144552280] [2023-02-15 13:24:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:08,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:08,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:08,509 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:08,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-15 13:24:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:08,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 13:24:08,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:08,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:09,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:24:09,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:24:09,153 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2601 (Array Int Int)) (v_ArrVal_2600 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2600)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2601) |c_#memory_$Pointer$.offset|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:24:09,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:09,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 13:24:09,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:09,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:09,201 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:24:09,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:24:09,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-15 13:24:09,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:24:09,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 13:24:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 13:24:09,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:09,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144552280] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:09,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:09,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2023-02-15 13:24:09,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487070148] [2023-02-15 13:24:09,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:09,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 13:24:09,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:09,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 13:24:09,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=897, Unknown=1, NotChecked=60, Total=1056 [2023-02-15 13:24:09,465 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:24:10,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:10,528 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2023-02-15 13:24:10,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:24:10,528 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-15 13:24:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:10,529 INFO L225 Difference]: With dead ends: 96 [2023-02-15 13:24:10,529 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 13:24:10,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=198, Invalid=1527, Unknown=1, NotChecked=80, Total=1806 [2023-02-15 13:24:10,531 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:10,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 767 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1127 Invalid, 0 Unknown, 100 Unchecked, 0.7s Time] [2023-02-15 13:24:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 13:24:10,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-15 13:24:10,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 91 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:10,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2023-02-15 13:24:10,534 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 46 [2023-02-15 13:24:10,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:10,534 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2023-02-15 13:24:10,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.5925925925925926) internal successors, (70), 26 states have internal predecessors, (70), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:24:10,534 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2023-02-15 13:24:10,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 13:24:10,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:10,535 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:10,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:10,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:10,741 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:10,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:10,742 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869774, now seen corresponding path program 1 times [2023-02-15 13:24:10,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:10,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269756668] [2023-02-15 13:24:10,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:10,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:11,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:11,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:11,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:12,225 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:12,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:12,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269756668] [2023-02-15 13:24:12,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269756668] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:12,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14532546] [2023-02-15 13:24:12,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:12,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:12,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:12,226 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:12,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-15 13:24:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:12,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 77 conjunts are in the unsatisfiable core [2023-02-15 13:24:12,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:12,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:12,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:24:12,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:24:12,766 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 29 treesize of output 32 [2023-02-15 13:24:12,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2023-02-15 13:24:12,774 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:24:12,775 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 7 [2023-02-15 13:24:12,955 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2856 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2855 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2855) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2856) |c_#memory_$Pointer$.base|))) is different from true [2023-02-15 13:24:12,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:13,006 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:24:13,007 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 35 treesize of output 41 [2023-02-15 13:24:13,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:13,011 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 26 treesize of output 28 [2023-02-15 13:24:13,035 INFO L321 Elim1Store]: treesize reduction 120, result has 31.4 percent of original size [2023-02-15 13:24:13,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 64 [2023-02-15 13:24:13,101 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 27 treesize of output 19 [2023-02-15 13:24:13,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:24:13,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2023-02-15 13:24:13,159 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 13:24:13,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:13,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14532546] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:13,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:13,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 34 [2023-02-15 13:24:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815465108] [2023-02-15 13:24:13,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:13,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 13:24:13,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:13,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 13:24:13,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1220, Unknown=1, NotChecked=70, Total=1406 [2023-02-15 13:24:13,337 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:24:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:15,083 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2023-02-15 13:24:15,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 13:24:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 48 [2023-02-15 13:24:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:15,084 INFO L225 Difference]: With dead ends: 161 [2023-02-15 13:24:15,085 INFO L226 Difference]: Without dead ends: 161 [2023-02-15 13:24:15,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=344, Invalid=2415, Unknown=1, NotChecked=102, Total=2862 [2023-02-15 13:24:15,085 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 679 mSDsluCounter, 1475 mSDsCounter, 0 mSdLazyCounter, 1848 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:15,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 1549 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1848 Invalid, 0 Unknown, 99 Unchecked, 1.0s Time] [2023-02-15 13:24:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-15 13:24:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 95. [2023-02-15 13:24:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.411764705882353) internal successors, (96), 90 states have internal predecessors, (96), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:15,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2023-02-15 13:24:15,087 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 48 [2023-02-15 13:24:15,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:15,088 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2023-02-15 13:24:15,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 2.1875) internal successors, (70), 31 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:24:15,088 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2023-02-15 13:24:15,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 13:24:15,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:15,088 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:15,097 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:15,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:15,289 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:15,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2067869775, now seen corresponding path program 1 times [2023-02-15 13:24:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:15,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366298911] [2023-02-15 13:24:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:16,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:16,782 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-15 13:24:16,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:16,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366298911] [2023-02-15 13:24:16,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366298911] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:16,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535838668] [2023-02-15 13:24:16,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:16,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:16,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:16,783 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:16,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-15 13:24:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:17,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 91 conjunts are in the unsatisfiable core [2023-02-15 13:24:17,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:17,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:17,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:24:17,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:24:17,521 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 13:24:17,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2023-02-15 13:24:17,533 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 13:24:17,533 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 31 treesize of output 25 [2023-02-15 13:24:17,543 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:24:17,543 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 7 [2023-02-15 13:24:17,696 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3112 (Array Int Int)) (v_ArrVal_3113 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3113)) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3112) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-15 13:24:17,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:17,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:17,735 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:24:17,735 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 78 treesize of output 71 [2023-02-15 13:24:17,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:17,746 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:24:17,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 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 83 [2023-02-15 13:24:17,762 INFO L321 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2023-02-15 13:24:17,762 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 34 treesize of output 36 [2023-02-15 13:24:17,766 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2023-02-15 13:24:17,878 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 13:24:17,879 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 87 treesize of output 50 [2023-02-15 13:24:17,886 INFO L321 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2023-02-15 13:24:17,886 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 44 treesize of output 28 [2023-02-15 13:24:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-15 13:24:17,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:18,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535838668] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:18,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:18,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21] total 41 [2023-02-15 13:24:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404864979] [2023-02-15 13:24:18,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:18,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-02-15 13:24:18,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-02-15 13:24:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1926, Unknown=1, NotChecked=88, Total=2162 [2023-02-15 13:24:18,247 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:24:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:20,647 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2023-02-15 13:24:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 13:24:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 48 [2023-02-15 13:24:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:20,648 INFO L225 Difference]: With dead ends: 144 [2023-02-15 13:24:20,648 INFO L226 Difference]: Without dead ends: 144 [2023-02-15 13:24:20,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=340, Invalid=3695, Unknown=1, NotChecked=124, Total=4160 [2023-02-15 13:24:20,649 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 247 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 2617 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 2240 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 2617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:20,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 2240 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 2617 Invalid, 0 Unknown, 152 Unchecked, 1.4s Time] [2023-02-15 13:24:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-15 13:24:20,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 94. [2023-02-15 13:24:20,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 89 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:20,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2023-02-15 13:24:20,651 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 48 [2023-02-15 13:24:20,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:20,651 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2023-02-15 13:24:20,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 2.0) internal successors, (76), 37 states have internal predecessors, (76), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:24:20,651 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2023-02-15 13:24:20,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:24:20,652 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:20,652 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:20,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:20,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-15 13:24:20,852 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:20,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432508, now seen corresponding path program 1 times [2023-02-15 13:24:20,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:20,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534494660] [2023-02-15 13:24:20,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:20,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-15 13:24:21,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:21,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534494660] [2023-02-15 13:24:21,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534494660] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:21,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:21,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:24:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289251592] [2023-02-15 13:24:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:24:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:21,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:24:21,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:24:21,221 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:21,443 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2023-02-15 13:24:21,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:24:21,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 51 [2023-02-15 13:24:21,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:21,445 INFO L225 Difference]: With dead ends: 160 [2023-02-15 13:24:21,445 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 13:24:21,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:24:21,446 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 355 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:21,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 399 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 13:24:21,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 97. [2023-02-15 13:24:21,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 72 states have (on average 1.375) internal successors, (99), 92 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2023-02-15 13:24:21,448 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 51 [2023-02-15 13:24:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:21,448 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2023-02-15 13:24:21,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:21,448 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2023-02-15 13:24:21,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 13:24:21,448 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:21,448 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:21,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 13:24:21,448 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:21,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1999432509, now seen corresponding path program 1 times [2023-02-15 13:24:21,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:21,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973605523] [2023-02-15 13:24:21,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 13:24:21,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:21,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973605523] [2023-02-15 13:24:21,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973605523] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:21,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:21,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:24:21,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718695923] [2023-02-15 13:24:21,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:21,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:24:21,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:21,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:24:21,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:24:21,763 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:21,985 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2023-02-15 13:24:21,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:24:21,986 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 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 51 [2023-02-15 13:24:21,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:21,986 INFO L225 Difference]: With dead ends: 146 [2023-02-15 13:24:21,986 INFO L226 Difference]: Without dead ends: 146 [2023-02-15 13:24:21,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:24:21,987 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 309 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:21,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 437 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:21,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-15 13:24:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 99. [2023-02-15 13:24:21,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.364864864864865) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2023-02-15 13:24:21,989 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 51 [2023-02-15 13:24:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:21,989 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2023-02-15 13:24:21,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2023-02-15 13:24:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 13:24:21,989 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:21,989 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:24:21,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 13:24:21,989 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:21,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1604261226, now seen corresponding path program 1 times [2023-02-15 13:24:21,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:21,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638823258] [2023-02-15 13:24:21,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:21,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:22,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:22,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:22,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:22,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638823258] [2023-02-15 13:24:22,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638823258] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:22,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865044396] [2023-02-15 13:24:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:22,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:22,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:22,419 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:22,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-15 13:24:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:22,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-15 13:24:22,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:22,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 13:24:22,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:22,975 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 26 treesize of output 19 [2023-02-15 13:24:23,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 13:24:23,034 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:24:23,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:23,090 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3730 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| v_ArrVal_3730) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (or (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_20| |c_#StackHeapBarrier|)) (<= 1 .cse0) (<= (+ .cse0 1) 0)))) is different from false [2023-02-15 13:24:23,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865044396] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:23,091 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:23,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2023-02-15 13:24:23,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932721607] [2023-02-15 13:24:23,091 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:23,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 13:24:23,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:23,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 13:24:23,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=669, Unknown=1, NotChecked=52, Total=812 [2023-02-15 13:24:23,093 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:24:23,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:23,497 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-02-15 13:24:23,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:24:23,498 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 53 [2023-02-15 13:24:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:23,499 INFO L225 Difference]: With dead ends: 90 [2023-02-15 13:24:23,499 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 13:24:23,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=1077, Unknown=1, NotChecked=68, Total=1332 [2023-02-15 13:24:23,500 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 236 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:23,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 621 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:23,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 13:24:23,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-02-15 13:24:23,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-15 13:24:23,505 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 53 [2023-02-15 13:24:23,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:23,505 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-15 13:24:23,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.72) internal successors, (68), 22 states have internal predecessors, (68), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-15 13:24:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-15 13:24:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 13:24:23,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:23,507 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:23,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-15 13:24:23,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 13:24:23,715 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:23,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:23,716 INFO L85 PathProgramCache]: Analyzing trace with hash -696733545, now seen corresponding path program 1 times [2023-02-15 13:24:23,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:23,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066781446] [2023-02-15 13:24:23,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:23,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:24,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:24,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-15 13:24:24,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:24,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066781446] [2023-02-15 13:24:24,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066781446] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:24,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:24,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-15 13:24:24,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535517940] [2023-02-15 13:24:24,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:24,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 13:24:24,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 13:24:24,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:24:24,471 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 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 13:24:24,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:24,872 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-02-15 13:24:24,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:24:24,872 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 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 54 [2023-02-15 13:24:24,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:24,873 INFO L225 Difference]: With dead ends: 107 [2023-02-15 13:24:24,873 INFO L226 Difference]: Without dead ends: 107 [2023-02-15 13:24:24,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:24:24,873 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 287 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:24,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 499 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:24:24,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-15 13:24:24,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 89. [2023-02-15 13:24:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 13:24:24,875 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 54 [2023-02-15 13:24:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:24,875 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 13:24:24,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.5625) internal successors, (41), 16 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 13:24:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 13:24:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 13:24:24,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:24,876 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:24,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 13:24:24,876 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:24,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:24,876 INFO L85 PathProgramCache]: Analyzing trace with hash -696733544, now seen corresponding path program 1 times [2023-02-15 13:24:24,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:24,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319302931] [2023-02-15 13:24:24,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:24,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:25,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:25,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:25,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319302931] [2023-02-15 13:24:25,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319302931] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:25,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:25,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2023-02-15 13:24:25,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943794125] [2023-02-15 13:24:25,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:25,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 13:24:25,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:25,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 13:24:25,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:24:25,817 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:26,308 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-02-15 13:24:26,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 13:24:26,309 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2023-02-15 13:24:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:26,309 INFO L225 Difference]: With dead ends: 88 [2023-02-15 13:24:26,309 INFO L226 Difference]: Without dead ends: 88 [2023-02-15 13:24:26,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2023-02-15 13:24:26,310 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 500 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:26,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 463 Invalid, 637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:24:26,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-02-15 13:24:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-02-15 13:24:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.353846153846154) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-15 13:24:26,313 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 54 [2023-02-15 13:24:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:26,313 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-15 13:24:26,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.4) internal successors, (48), 19 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-15 13:24:26,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:24:26,313 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:26,313 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:26,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:24:26,313 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:26,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:26,314 INFO L85 PathProgramCache]: Analyzing trace with hash -833520442, now seen corresponding path program 1 times [2023-02-15 13:24:26,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:26,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029506756] [2023-02-15 13:24:26,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:26,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:27,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:27,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:27,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:27,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029506756] [2023-02-15 13:24:27,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029506756] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:27,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952657214] [2023-02-15 13:24:27,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:27,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:27,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:27,677 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:27,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-15 13:24:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:27,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 13:24:27,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:27,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:28,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-15 13:24:28,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:28,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:28,706 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2023-02-15 13:24:28,719 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 13:24:28,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 13:24:28,892 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:24:28,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 13:24:28,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:28,998 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 13:24:29,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 67 [2023-02-15 13:24:29,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:29,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:29,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 53 [2023-02-15 13:24:29,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:24:29,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-02-15 13:24:29,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2023-02-15 13:24:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:24:29,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:24:29,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952657214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:29,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:24:29,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [26] total 46 [2023-02-15 13:24:29,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591979950] [2023-02-15 13:24:29,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:29,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-15 13:24:29,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:29,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-15 13:24:29,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2000, Unknown=1, NotChecked=0, Total=2162 [2023-02-15 13:24:29,536 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 23 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:30,875 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-15 13:24:30,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 13:24:30,876 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2023-02-15 13:24:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:30,877 INFO L225 Difference]: With dead ends: 108 [2023-02-15 13:24:30,877 INFO L226 Difference]: Without dead ends: 108 [2023-02-15 13:24:30,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=362, Invalid=3059, Unknown=1, NotChecked=0, Total=3422 [2023-02-15 13:24:30,878 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 425 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 14 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:30,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 449 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 710 Invalid, 2 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:24:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-15 13:24:30,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2023-02-15 13:24:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 66 states have (on average 1.3636363636363635) internal successors, (90), 84 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-15 13:24:30,879 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 59 [2023-02-15 13:24:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:30,880 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-15 13:24:30,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.5238095238095237) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:24:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-15 13:24:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 13:24:30,880 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:30,880 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:30,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:31,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:31,090 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:31,090 INFO L85 PathProgramCache]: Analyzing trace with hash -833520441, now seen corresponding path program 1 times [2023-02-15 13:24:31,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:31,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015377752] [2023-02-15 13:24:31,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:31,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:32,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:32,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:32,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:32,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:33,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:33,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015377752] [2023-02-15 13:24:33,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015377752] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:33,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786847071] [2023-02-15 13:24:33,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:33,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:33,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:33,476 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:33,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-15 13:24:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:33,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 114 conjunts are in the unsatisfiable core [2023-02-15 13:24:33,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:33,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:33,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:33,966 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:24:33,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:24:34,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:34,358 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 13 treesize of output 9 [2023-02-15 13:24:34,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:24:34,542 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 23 [2023-02-15 13:24:34,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:34,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:34,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:24:34,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:34,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:34,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:34,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:24:34,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:34,963 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:24:34,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 48 [2023-02-15 13:24:34,974 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-15 13:24:34,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-02-15 13:24:35,420 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2023-02-15 13:24:35,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 79 treesize of output 84 [2023-02-15 13:24:35,432 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:24:35,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 48 [2023-02-15 13:24:35,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:24:35,438 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2023-02-15 13:24:35,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:35,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:35,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:35,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-02-15 13:24:35,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:35,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-02-15 13:24:35,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:35,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:35,679 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:24:35,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 13:24:35,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:35,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:24:35,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-15 13:24:35,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:24:35,760 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:24:35,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:36,187 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) .cse0 v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 13:24:36,206 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) .cse0 v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 13:24:36,215 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) .cse0 v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2023-02-15 13:24:36,233 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (and (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) .cse1 v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 13:24:36,251 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) .cse1 v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4645) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2023-02-15 13:24:36,305 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4645) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4640 (Array Int Int)) (v_ArrVal_4641 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4640) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4644))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4641) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4645) .cse1 v_ArrVal_4647) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_4646) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2023-02-15 13:24:36,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786847071] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:36,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:36,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 53 [2023-02-15 13:24:36,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162244589] [2023-02-15 13:24:36,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:36,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 13:24:36,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:36,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 13:24:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3257, Unknown=64, NotChecked=726, Total=4290 [2023-02-15 13:24:36,577 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 54 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:24:39,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:39,461 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2023-02-15 13:24:39,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 13:24:39,461 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 59 [2023-02-15 13:24:39,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:39,462 INFO L225 Difference]: With dead ends: 112 [2023-02-15 13:24:39,462 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 13:24:39,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=565, Invalid=5554, Unknown=67, NotChecked=954, Total=7140 [2023-02-15 13:24:39,464 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 803 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:39,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 846 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1788 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2023-02-15 13:24:39,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 13:24:39,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 91. [2023-02-15 13:24:39,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.3529411764705883) internal successors, (92), 86 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:39,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2023-02-15 13:24:39,500 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 59 [2023-02-15 13:24:39,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:39,500 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2023-02-15 13:24:39,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.98) internal successors, (99), 46 states have internal predecessors, (99), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 13:24:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2023-02-15 13:24:39,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 13:24:39,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:39,500 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:39,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:39,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-15 13:24:39,701 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:39,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:39,702 INFO L85 PathProgramCache]: Analyzing trace with hash 2145741940, now seen corresponding path program 1 times [2023-02-15 13:24:39,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:39,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109320348] [2023-02-15 13:24:39,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:39,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:42,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:24:43,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:43,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109320348] [2023-02-15 13:24:43,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109320348] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:43,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499605920] [2023-02-15 13:24:43,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:43,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:24:43,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:24:43,704 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:24:43,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-15 13:24:44,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:44,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 153 conjunts are in the unsatisfiable core [2023-02-15 13:24:44,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:24:44,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:24:44,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:24:44,211 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:24:44,211 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 13:24:44,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:24:44,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:24:44,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:44,571 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 13:24:44,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-15 13:24:44,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 13:24:44,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:44,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:45,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:24:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:45,022 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 13:24:45,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:24:45,314 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 32 [2023-02-15 13:24:45,318 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:24:45,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:45,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-15 13:24:45,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:24:45,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:45,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:45,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:45,853 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:24:45,853 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 77 treesize of output 65 [2023-02-15 13:24:45,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:45,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:45,870 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-15 13:24:45,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-15 13:24:45,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:24:46,527 INFO L321 Elim1Store]: treesize reduction 68, result has 17.1 percent of original size [2023-02-15 13:24:46,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 129 treesize of output 110 [2023-02-15 13:24:46,542 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:24:46,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 49 [2023-02-15 13:24:46,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:46,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2023-02-15 13:24:46,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:46,576 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:24:46,576 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 75 treesize of output 63 [2023-02-15 13:24:46,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:24:46,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:46,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:46,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:46,641 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:24:46,641 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 75 treesize of output 63 [2023-02-15 13:24:46,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:24:46,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:46,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:24:46,868 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:24:46,868 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 2 case distinctions, treesize of input 90 treesize of output 71 [2023-02-15 13:24:46,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:46,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-15 13:24:46,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:24:46,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:24:46,883 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 17 treesize of output 13 [2023-02-15 13:24:46,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 13:24:46,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:24:47,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:24:47,162 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:24:47,163 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:24:48,266 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4971 (Array Int Int)) (v_ArrVal_4972 (Array Int Int)) (v_ArrVal_4975 Int) (v_ArrVal_4963 (Array Int Int)) (v_ArrVal_4974 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (v_ArrVal_4965 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_4969 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4965) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4971))) (or (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse0 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4964) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4970))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_4963) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4969))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_4975))) (select (select (store .cse3 .cse2 v_ArrVal_4974) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse0 .cse2 v_ArrVal_4972) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))))) is different from false [2023-02-15 13:24:48,278 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4971 (Array Int Int)) (v_ArrVal_4972 (Array Int Int)) (v_ArrVal_4975 Int) (v_ArrVal_4963 (Array Int Int)) (v_ArrVal_4974 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (v_ArrVal_4965 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_4969 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4965) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4971))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4964) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4970))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_append_#t~mem12#1.base| v_ArrVal_4963) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4969))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_4975))) (select (select (store .cse2 .cse1 v_ArrVal_4974) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse3 .cse1 v_ArrVal_4972) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))) is different from false [2023-02-15 13:24:48,692 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4971 (Array Int Int)) (v_ArrVal_4972 (Array Int Int)) (v_ArrVal_4975 Int) (v_ArrVal_4963 (Array Int Int)) (v_ArrVal_4974 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (v_ArrVal_4965 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_4969 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4965) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4971))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4964) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4970))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse2 v_ArrVal_4963) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_4969))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_4975))) (select (select (store .cse3 .cse1 v_ArrVal_4974) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_4972) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))))) is different from false [2023-02-15 13:24:48,725 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4971 (Array Int Int)) (v_ArrVal_4972 (Array Int Int)) (v_ArrVal_4975 Int) (v_ArrVal_4963 (Array Int Int)) (v_ArrVal_4974 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (v_ArrVal_4965 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_4969 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_4965) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4971))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_4964) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4970))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store |c_#memory_int| .cse2 v_ArrVal_4963) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_4969))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_4975))) (select (select (store .cse3 .cse1 v_ArrVal_4974) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store .cse4 .cse1 v_ArrVal_4972) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))))) is different from false [2023-02-15 13:24:48,836 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4975 Int) (|v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| Int) (|v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| Int) (v_ArrVal_4990 (Array Int Int)) (v_ArrVal_4970 (Array Int Int)) (v_ArrVal_4971 (Array Int Int)) (v_ArrVal_4972 (Array Int Int)) (v_ArrVal_4963 (Array Int Int)) (v_ArrVal_4974 (Array Int Int)) (v_ArrVal_4964 (Array Int Int)) (v_ArrVal_4965 (Array Int Int)) (v_ArrVal_4988 (Array Int Int)) (v_ArrVal_4989 (Array Int Int)) (v_ArrVal_4969 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4989)) (.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4990))) (let ((.cse2 (select (select .cse5 (select (select .cse5 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ 4 (select (select .cse6 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))))) (let ((.cse4 (store (store .cse6 .cse2 v_ArrVal_4965) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4971))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (store .cse5 .cse2 v_ArrVal_4964) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4970))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (select (let ((.cse0 (store (store (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4988) .cse2 v_ArrVal_4963) |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| v_ArrVal_4969))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| 4) v_ArrVal_4975))) (select (select (store .cse3 .cse1 v_ArrVal_4974) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store .cse4 .cse1 v_ArrVal_4972) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (not (< |v_ULTIMATE.start_dll_circular_append_#t~ret9#1.base_27| |c_#StackHeapBarrier|)) (not (<= |v_ULTIMATE.start_dll_circular_append_#t~mem14#1.offset_9| (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)))))))) is different from false [2023-02-15 13:24:48,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499605920] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:24:48,838 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:24:48,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 33] total 71 [2023-02-15 13:24:48,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615143349] [2023-02-15 13:24:48,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:24:48,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2023-02-15 13:24:48,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2023-02-15 13:24:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=5407, Unknown=205, NotChecked=770, Total=6642 [2023-02-15 13:24:48,841 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 71 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 62 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:24:55,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:55,877 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2023-02-15 13:24:55,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 13:24:55,877 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 62 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 61 [2023-02-15 13:24:55,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:55,878 INFO L225 Difference]: With dead ends: 110 [2023-02-15 13:24:55,878 INFO L226 Difference]: Without dead ends: 110 [2023-02-15 13:24:55,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=834, Invalid=10089, Unknown=227, NotChecked=1060, Total=12210 [2023-02-15 13:24:55,881 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 528 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 3480 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 3480 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:55,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1333 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 3480 Invalid, 2 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 13:24:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-02-15 13:24:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 91. [2023-02-15 13:24:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 68 states have (on average 1.338235294117647) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2023-02-15 13:24:55,882 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 61 [2023-02-15 13:24:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:55,882 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2023-02-15 13:24:55,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 62 states have internal predecessors, (108), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:24:55,882 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2023-02-15 13:24:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 13:24:55,883 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:55,883 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:55,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:24:56,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-15 13:24:56,091 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:56,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557417, now seen corresponding path program 1 times [2023-02-15 13:24:56,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:56,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663066491] [2023-02-15 13:24:56,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:56,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:56,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,179 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 13:24:56,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:56,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663066491] [2023-02-15 13:24:56,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663066491] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:56,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:56,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:24:56,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302463152] [2023-02-15 13:24:56,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:56,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:24:56,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:56,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:24:56,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:24:56,182 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:56,260 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2023-02-15 13:24:56,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:24:56,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-15 13:24:56,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:56,261 INFO L225 Difference]: With dead ends: 109 [2023-02-15 13:24:56,261 INFO L226 Difference]: Without dead ends: 109 [2023-02-15 13:24:56,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:24:56,262 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:56,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 304 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:24:56,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-15 13:24:56,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2023-02-15 13:24:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:56,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-02-15 13:24:56,264 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 64 [2023-02-15 13:24:56,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:56,264 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-02-15 13:24:56,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:56,265 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-02-15 13:24:56,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 13:24:56,265 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:56,265 INFO L195 NwaCegarLoop]: trace histogram [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 13:24:56,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-15 13:24:56,265 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:56,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:56,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1799557418, now seen corresponding path program 1 times [2023-02-15 13:24:56,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:56,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346707240] [2023-02-15 13:24:56,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:56,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-15 13:24:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:24:56,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346707240] [2023-02-15 13:24:56,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346707240] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:24:56,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:24:56,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:24:56,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874062770] [2023-02-15 13:24:56,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:24:56,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:24:56,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:24:56,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:24:56,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:24:56,426 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:24:56,571 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2023-02-15 13:24:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:24:56,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 64 [2023-02-15 13:24:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:24:56,572 INFO L225 Difference]: With dead ends: 90 [2023-02-15 13:24:56,572 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 13:24:56,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:24:56,573 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 47 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:24:56,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 363 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:24:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 13:24:56,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2023-02-15 13:24:56,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:24:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2023-02-15 13:24:56,578 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 64 [2023-02-15 13:24:56,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:24:56,579 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2023-02-15 13:24:56,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:24:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2023-02-15 13:24:56,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 13:24:56,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:24:56,579 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-02-15 13:24:56,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-02-15 13:24:56,580 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:24:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:24:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139761, now seen corresponding path program 1 times [2023-02-15 13:24:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:24:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557227173] [2023-02-15 13:24:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:24:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:24:56,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:59,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:24:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:59,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:24:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:24:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:24:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:25:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:25:00,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:25:00,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557227173] [2023-02-15 13:25:00,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557227173] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:25:00,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397972049] [2023-02-15 13:25:00,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:25:00,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:25:00,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:25:00,303 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:25:00,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-15 13:25:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:25:00,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 110 conjunts are in the unsatisfiable core [2023-02-15 13:25:00,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:25:00,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:25:01,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 13:25:01,394 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 13:25:01,394 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 34 treesize of output 15 [2023-02-15 13:25:01,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:25:01,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:01,840 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:25:01,840 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 44 treesize of output 48 [2023-02-15 13:25:01,854 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-15 13:25:01,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2023-02-15 13:25:01,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:01,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-02-15 13:25:02,387 INFO L321 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2023-02-15 13:25:02,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 86 treesize of output 91 [2023-02-15 13:25:02,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:25:02,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 54 [2023-02-15 13:25:02,405 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:25:02,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2023-02-15 13:25:02,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:25:02,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:02,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-02-15 13:25:02,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:25:02,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:02,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 33 treesize of output 31 [2023-02-15 13:25:02,621 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 13:25:02,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 44 [2023-02-15 13:25:02,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:02,627 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 71 treesize of output 69 [2023-02-15 13:25:02,774 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 68 treesize of output 52 [2023-02-15 13:25:02,874 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 13:25:02,874 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 80 treesize of output 31 [2023-02-15 13:25:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:25:03,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:25:03,529 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5626 (Array Int Int)) (v_ArrVal_5625 (Array Int Int)) (v_ArrVal_5629 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5625))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5626)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store .cse3 .cse2 v_ArrVal_5629) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) 1)) is different from false [2023-02-15 13:25:03,559 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5622 (Array Int Int)) (v_ArrVal_5621 (Array Int Int)) (v_ArrVal_5626 (Array Int Int)) (v_ArrVal_5625 (Array Int Int)) (v_ArrVal_5629 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5621) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5625))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5622) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5626)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5629) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 1)) is different from false [2023-02-15 13:25:05,922 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5622 (Array Int Int)) (v_ArrVal_5621 (Array Int Int)) (v_ArrVal_5626 (Array Int Int)) (v_ArrVal_5625 (Array Int Int)) (v_ArrVal_5629 (Array Int Int))) (= (select |c_#valid| (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_append_#t~mem11#1.offset| 4)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5621) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5625))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5622) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5626)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5629) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) 1)) is different from false [2023-02-15 13:25:05,959 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5622 (Array Int Int)) (v_ArrVal_5621 (Array Int Int)) (v_ArrVal_5626 (Array Int Int)) (v_ArrVal_5625 (Array Int Int)) (v_ArrVal_5629 (Array Int Int))) (= (select |c_#valid| (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5621) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5625))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5622) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5626)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5629) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) 1)) is different from false [2023-02-15 13:25:05,976 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5622 (Array Int Int)) (v_ArrVal_5621 (Array Int Int)) (v_ArrVal_5626 (Array Int Int)) (v_ArrVal_5625 (Array Int Int)) (v_ArrVal_5629 (Array Int Int))) (= (select |c_#valid| (let ((.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4)))) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_5621) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5625))) (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_5622) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5626)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_5629) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))) 1)) is different from false [2023-02-15 13:25:06,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397972049] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:25:06,237 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 13:25:06,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 29] total 66 [2023-02-15 13:25:06,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13890117] [2023-02-15 13:25:06,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 13:25:06,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-02-15 13:25:06,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:25:06,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-02-15 13:25:06,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=5210, Unknown=121, NotChecked=750, Total=6320 [2023-02-15 13:25:06,239 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 67 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 59 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:25:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:25:14,479 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2023-02-15 13:25:14,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-02-15 13:25:14,480 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 59 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 66 [2023-02-15 13:25:14,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:25:14,483 INFO L225 Difference]: With dead ends: 112 [2023-02-15 13:25:14,483 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 13:25:14,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2310 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1007, Invalid=10649, Unknown=136, NotChecked=1090, Total=12882 [2023-02-15 13:25:14,487 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 916 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 2932 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2932 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:25:14,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1112 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2932 Invalid, 2 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 13:25:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 13:25:14,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2023-02-15 13:25:14,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.3013698630136987) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:25:14,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2023-02-15 13:25:14,502 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 66 [2023-02-15 13:25:14,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:25:14,503 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2023-02-15 13:25:14,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 59 states have internal predecessors, (119), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 13:25:14,503 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2023-02-15 13:25:14,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-15 13:25:14,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:25:14,503 INFO L195 NwaCegarLoop]: trace histogram [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, 1] [2023-02-15 13:25:14,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-15 13:25:14,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:25:14,711 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2023-02-15 13:25:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:25:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1497139760, now seen corresponding path program 1 times [2023-02-15 13:25:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:25:14,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92581895] [2023-02-15 13:25:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:25:14,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:25:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:25:18,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-15 13:25:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:25:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-15 13:25:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:25:18,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-15 13:25:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:25:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 13:25:18,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:25:18,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92581895] [2023-02-15 13:25:18,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92581895] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:25:18,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733021402] [2023-02-15 13:25:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:25:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:25:18,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:25:18,875 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:25:18,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-15 13:25:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:25:19,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 99 conjunts are in the unsatisfiable core [2023-02-15 13:25:19,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:25:19,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 13:25:19,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:25:19,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:19,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:25:20,009 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 13:25:20,009 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 28 [2023-02-15 13:25:20,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:25:20,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:20,115 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 13:25:20,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 32 [2023-02-15 13:25:20,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:25:20,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:25:20,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:25:20,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:20,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:25:20,260 INFO L321 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-02-15 13:25:20,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 46 [2023-02-15 13:25:20,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:20,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2023-02-15 13:25:20,561 INFO L321 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2023-02-15 13:25:20,561 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 115 treesize of output 60 [2023-02-15 13:25:20,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:25:20,564 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 19 [2023-02-15 13:25:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 13:25:20,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:25:21,199 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5933 (Array Int Int))) (<= 0 (+ (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5933)) (.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5932))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 8))) (forall ((v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5933 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5933)) (.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5932))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse8 (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ (select (select .cse5 .cse6) .cse7) 12) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))) is different from false [2023-02-15 13:25:21,285 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5929 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5933 (Array Int Int))) (<= 0 (+ (let ((.cse4 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5929) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5933)) (.cse1 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5932))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse3 (+ (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|)))) (select (select .cse0 (select (select (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 8))) (forall ((v_ArrVal_5929 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5933 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5929) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5933)) (.cse9 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base| v_ArrVal_5932))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse5 (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.offset|))) (.cse8 (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_~new_last~0#1.base|)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ (select (select .cse5 .cse6) .cse7) 12) (select |c_#length| (select (select .cse8 .cse6) .cse7))))))))) is different from false [2023-02-15 13:25:21,365 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5929 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5933 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5929) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5933)) (.cse4 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5932))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse6 (+ (select (select .cse7 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse0 (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|))) (.cse3 (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))))) (forall ((v_ArrVal_5929 (Array Int Int)) (|ULTIMATE.start_dll_circular_append_~last~1#1.base| Int) (|ULTIMATE.start_dll_circular_append_~last~1#1.offset| Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5933 (Array Int Int))) (<= 0 (+ (let ((.cse12 (store (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_dll_circular_append_~last~1#1.base| v_ArrVal_5929) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5933)) (.cse9 (store (store |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_append_~last~1#1.base|) |ULTIMATE.start_dll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base| v_ArrVal_5932))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|)) (.cse11 (+ (select (select .cse12 |c_ULTIMATE.start_dll_circular_append_~head#1.base|) |c_ULTIMATE.start_dll_circular_append_~head#1.offset|) 4))) (let ((.cse8 (store .cse12 .cse10 (store (select .cse12 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.offset|)))) (select (select .cse8 (select (select (store .cse9 .cse10 (store (select .cse9 .cse10) .cse11 |c_ULTIMATE.start_dll_circular_append_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) 8)))) is different from false [2023-02-15 13:27:02,242 WARN L233 SmtUtils]: Spent 1.65m on a formula simplification. DAG size of input: 347 DAG size of output: 275 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-02-15 13:27:02,243 INFO L321 Elim1Store]: treesize reduction 2026, result has 71.3 percent of original size [2023-02-15 13:27:02,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 14 new quantified variables, introduced 66 case distinctions, treesize of input 1824729709 treesize of output 1757624538 [2023-02-15 13:27:15,189 INFO L217 Elim1Store]: Index analysis took 9514 ms