./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/sll2n_update_all.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 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:26:41,615 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:26:41,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:26:41,645 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:26:41,645 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:26:41,646 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:26:41,647 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:26:41,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:26:41,649 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:26:41,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:26:41,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:26:41,651 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:26:41,652 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:26:41,652 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:26:41,653 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:26:41,654 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:26:41,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:26:41,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:26:41,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:26:41,657 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:26:41,658 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:26:41,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:26:41,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:26:41,660 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:26:41,660 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:26:41,662 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:26:41,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:26:41,663 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:26:41,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:26:41,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:26:41,665 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:26:41,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:26:41,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:26:41,666 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:26:41,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:26:41,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:26:41,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:26:41,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:26:41,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:26:41,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:26:41,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:26:41,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:26:41,678 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:26:41,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:26:41,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:26:41,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:26:41,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:26:41,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:26:41,697 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:26:41,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:26:41,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:26:41,697 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:26:41,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:26:41,698 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:26:41,698 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:26:41,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:26:41,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:26:41,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:26:41,699 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:26:41,699 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:26:41,699 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:26:41,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:26:41,699 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:26:41,700 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:26:41,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:26:41,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:26:41,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:26:41,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:26:41,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:26:41,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:26:41,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:26:41,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:26:41,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:26:41,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 1fd0aba5d9be2820550e57012fb4e12f76fe291bb253443319d08539e5b2ba1a [2022-07-20 06:26:41,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:26:41,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:26:41,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:26:41,941 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:26:41,941 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:26:41,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-07-20 06:26:42,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ded85cf0/b4b1aa340a124f0eac2f9edaa803e54a/FLAGd8f6ea535 [2022-07-20 06:26:42,455 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:26:42,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_update_all.i [2022-07-20 06:26:42,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ded85cf0/b4b1aa340a124f0eac2f9edaa803e54a/FLAGd8f6ea535 [2022-07-20 06:26:42,493 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ded85cf0/b4b1aa340a124f0eac2f9edaa803e54a [2022-07-20 06:26:42,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:26:42,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:26:42,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:26:42,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:26:42,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:26:42,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,501 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@287a9f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42, skipping insertion in model container [2022-07-20 06:26:42,502 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:26:42,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:26:42,820 WARN L230 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/sll2n_update_all.i[24218,24231] [2022-07-20 06:26:42,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:26:42,833 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:26:42,868 WARN L230 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/sll2n_update_all.i[24218,24231] [2022-07-20 06:26:42,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:26:42,890 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:26:42,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42 WrapperNode [2022-07-20 06:26:42,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:26:42,892 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:26:42,892 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:26:42,893 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:26:42,898 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,943 INFO L137 Inliner]: procedures = 126, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-07-20 06:26:42,944 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:26:42,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:26:42,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:26:42,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:26:42,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:42,988 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:26:42,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:26:42,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:26:42,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:26:43,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (1/1) ... [2022-07-20 06:26:43,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:26:43,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:43,040 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) [2022-07-20 06:26:43,064 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 [2022-07-20 06:26:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:26:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:26:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:26:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:26:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:26:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:26:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:26:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:26:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:26:43,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:26:43,161 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:26:43,162 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:26:43,373 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:26:43,378 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:26:43,378 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-20 06:26:43,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:26:43 BoogieIcfgContainer [2022-07-20 06:26:43,380 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:26:43,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:26:43,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:26:43,384 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:26:43,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:26:42" (1/3) ... [2022-07-20 06:26:43,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fa333c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:26:43, skipping insertion in model container [2022-07-20 06:26:43,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:26:42" (2/3) ... [2022-07-20 06:26:43,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62fa333c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:26:43, skipping insertion in model container [2022-07-20 06:26:43,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:26:43" (3/3) ... [2022-07-20 06:26:43,386 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_update_all.i [2022-07-20 06:26:43,396 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:26:43,396 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-07-20 06:26:43,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:26:43,444 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62bcbc6d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3386cbe6 [2022-07-20 06:26:43,444 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-07-20 06:26:43,460 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:26:43,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:43,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:26:43,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:43,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:43,471 INFO L85 PathProgramCache]: Analyzing trace with hash 28698858, now seen corresponding path program 1 times [2022-07-20 06:26:43,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:43,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203762311] [2022-07-20 06:26:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:43,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:43,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:43,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203762311] [2022-07-20 06:26:43,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203762311] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:43,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:43,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:26:43,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949213766] [2022-07-20 06:26:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:43,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:26:43,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:43,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:26:43,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:26:43,665 INFO L87 Difference]: Start difference. First operand has 64 states, 42 states have (on average 1.8333333333333333) internal successors, (77), 63 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:43,744 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2022-07-20 06:26:43,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:26:43,746 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:26:43,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:43,751 INFO L225 Difference]: With dead ends: 109 [2022-07-20 06:26:43,751 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 06:26:43,752 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 [2022-07-20 06:26:43,755 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 63 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:43,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 133 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:26:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 06:26:43,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-07-20 06:26:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.6) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-07-20 06:26:43,789 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 5 [2022-07-20 06:26:43,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:43,789 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-07-20 06:26:43,790 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,790 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-07-20 06:26:43,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:26:43,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:43,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:26:43,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:26:43,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:43,791 INFO L85 PathProgramCache]: Analyzing trace with hash 28698859, now seen corresponding path program 1 times [2022-07-20 06:26:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:43,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426602731] [2022-07-20 06:26:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:43,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:43,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:43,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426602731] [2022-07-20 06:26:43,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426602731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:43,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:43,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:26:43,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453278352] [2022-07-20 06:26:43,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:43,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:26:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:43,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:26:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:26:43,850 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:43,885 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-07-20 06:26:43,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:26:43,885 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 06:26:43,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:43,886 INFO L225 Difference]: With dead ends: 102 [2022-07-20 06:26:43,886 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 06:26:43,887 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 [2022-07-20 06:26:43,888 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 58 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:43,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:26:43,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 06:26:43,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 57. [2022-07-20 06:26:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.55) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-07-20 06:26:43,892 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 5 [2022-07-20 06:26:43,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:43,893 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-07-20 06:26:43,893 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-07-20 06:26:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:26:43,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:43,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:43,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:26:43,894 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:43,895 INFO L85 PathProgramCache]: Analyzing trace with hash 231010834, now seen corresponding path program 1 times [2022-07-20 06:26:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:43,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944820502] [2022-07-20 06:26:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:43,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:43,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:43,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:43,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944820502] [2022-07-20 06:26:43,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944820502] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:43,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:43,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:26:43,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637796162] [2022-07-20 06:26:43,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:43,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:26:43,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:43,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:26:43,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:26:43,913 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:43,920 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-07-20 06:26:43,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:26:43,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-20 06:26:43,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:43,921 INFO L225 Difference]: With dead ends: 68 [2022-07-20 06:26:43,921 INFO L226 Difference]: Without dead ends: 68 [2022-07-20 06:26:43,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:26:43,922 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:43,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:26:43,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-20 06:26:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 58. [2022-07-20 06:26:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 57 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2022-07-20 06:26:43,927 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 8 [2022-07-20 06:26:43,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:43,927 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2022-07-20 06:26:43,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2022-07-20 06:26:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:26:43,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:43,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:43,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:26:43,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:43,929 INFO L85 PathProgramCache]: Analyzing trace with hash -245418610, now seen corresponding path program 1 times [2022-07-20 06:26:43,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:43,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881426580] [2022-07-20 06:26:43,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:43,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:43,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:43,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881426580] [2022-07-20 06:26:43,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881426580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:43,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:43,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:26:43,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653831892] [2022-07-20 06:26:43,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:43,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:26:43,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:43,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:26:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:26:43,971 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:44,035 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-07-20 06:26:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:26:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 06:26:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:44,037 INFO L225 Difference]: With dead ends: 76 [2022-07-20 06:26:44,038 INFO L226 Difference]: Without dead ends: 76 [2022-07-20 06:26:44,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:26:44,044 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 164 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:44,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 67 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:26:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-20 06:26:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 57. [2022-07-20 06:26:44,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-07-20 06:26:44,067 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 9 [2022-07-20 06:26:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:44,067 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-07-20 06:26:44,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-07-20 06:26:44,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:26:44,068 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:44,068 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:44,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:26:44,068 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash -245418609, now seen corresponding path program 1 times [2022-07-20 06:26:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:44,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563947142] [2022-07-20 06:26:44,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:44,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:44,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:44,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:44,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563947142] [2022-07-20 06:26:44,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563947142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:44,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:44,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:26:44,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179922429] [2022-07-20 06:26:44,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:44,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:26:44,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:44,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:26:44,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:26:44,164 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:44,261 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-07-20 06:26:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:26:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-20 06:26:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:44,262 INFO L225 Difference]: With dead ends: 61 [2022-07-20 06:26:44,262 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 06:26:44,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:26:44,263 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 163 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:44,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:26:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 06:26:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 56. [2022-07-20 06:26:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 55 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-07-20 06:26:44,271 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 9 [2022-07-20 06:26:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:44,272 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-07-20 06:26:44,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-07-20 06:26:44,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:26:44,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:44,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:44,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:26:44,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash -806744226, now seen corresponding path program 1 times [2022-07-20 06:26:44,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:44,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462083266] [2022-07-20 06:26:44,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:44,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:44,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462083266] [2022-07-20 06:26:44,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462083266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599624852] [2022-07-20 06:26:44,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:44,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:44,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:44,336 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) [2022-07-20 06:26:44,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 06:26:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:44,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:26:44,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:44,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:44,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:26:44,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599624852] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:26:44,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:26:44,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-20 06:26:44,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555436682] [2022-07-20 06:26:44,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:44,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:26:44,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:44,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:26:44,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:26:44,490 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:44,498 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-07-20 06:26:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:26:44,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 06:26:44,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:44,499 INFO L225 Difference]: With dead ends: 65 [2022-07-20 06:26:44,499 INFO L226 Difference]: Without dead ends: 65 [2022-07-20 06:26:44,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:26:44,500 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:44,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 163 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:26:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-20 06:26:44,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-07-20 06:26:44,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.4) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-07-20 06:26:44,503 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 17 [2022-07-20 06:26:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:44,504 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-07-20 06:26:44,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:44,504 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-07-20 06:26:44,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:26:44,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:44,511 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:44,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:44,747 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 [2022-07-20 06:26:44,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:44,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913170, now seen corresponding path program 2 times [2022-07-20 06:26:44,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:44,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597872118] [2022-07-20 06:26:44,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:44,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:26:44,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:44,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597872118] [2022-07-20 06:26:44,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597872118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:44,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:44,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:26:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838566604] [2022-07-20 06:26:44,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:44,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:26:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:26:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:26:44,834 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:45,018 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-20 06:26:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:26:45,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:26:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:45,020 INFO L225 Difference]: With dead ends: 116 [2022-07-20 06:26:45,020 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 06:26:45,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:26:45,022 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 379 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:45,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 141 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:26:45,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 06:26:45,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 68. [2022-07-20 06:26:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-20 06:26:45,039 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 26 [2022-07-20 06:26:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:45,039 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-20 06:26:45,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-20 06:26:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:26:45,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:45,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:45,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:26:45,041 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:45,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2130913171, now seen corresponding path program 1 times [2022-07-20 06:26:45,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:45,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187734344] [2022-07-20 06:26:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:45,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:45,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:45,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:45,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187734344] [2022-07-20 06:26:45,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187734344] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:45,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:45,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:26:45,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756149482] [2022-07-20 06:26:45,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:45,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:26:45,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:45,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:26:45,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:26:45,153 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:45,336 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-07-20 06:26:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:26:45,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 06:26:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:45,337 INFO L225 Difference]: With dead ends: 103 [2022-07-20 06:26:45,337 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 06:26:45,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:26:45,338 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 389 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:45,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 103 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:26:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 06:26:45,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 68. [2022-07-20 06:26:45,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2022-07-20 06:26:45,340 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 26 [2022-07-20 06:26:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:45,340 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2022-07-20 06:26:45,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,341 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-07-20 06:26:45,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:26:45,341 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:45,341 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:45,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:26:45,341 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:45,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:45,342 INFO L85 PathProgramCache]: Analyzing trace with hash -893075880, now seen corresponding path program 1 times [2022-07-20 06:26:45,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:45,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332611071] [2022-07-20 06:26:45,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:45,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:45,397 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:26:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:45,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332611071] [2022-07-20 06:26:45,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332611071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:45,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:45,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:26:45,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423748955] [2022-07-20 06:26:45,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:45,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:26:45,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:45,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:26:45,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:26:45,400 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:45,544 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2022-07-20 06:26:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:26:45,544 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 06:26:45,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:45,544 INFO L225 Difference]: With dead ends: 103 [2022-07-20 06:26:45,545 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 06:26:45,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:26:45,545 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 363 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:45,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 124 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:26:45,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 06:26:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-07-20 06:26:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-07-20 06:26:45,548 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 28 [2022-07-20 06:26:45,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:45,549 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-07-20 06:26:45,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-07-20 06:26:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:26:45,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:45,550 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:45,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:26:45,550 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:45,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash -893075879, now seen corresponding path program 1 times [2022-07-20 06:26:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:45,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849084592] [2022-07-20 06:26:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:45,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849084592] [2022-07-20 06:26:45,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849084592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:45,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618821699] [2022-07-20 06:26:45,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:45,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:45,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:45,626 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) [2022-07-20 06:26:45,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 06:26:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:45,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:26:45,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:45,747 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:26:45,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:26:45,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618821699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:45,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:26:45,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-20 06:26:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467888079] [2022-07-20 06:26:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:45,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:26:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:45,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:26:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:26:45,750 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:45,762 INFO L93 Difference]: Finished difference Result 103 states and 118 transitions. [2022-07-20 06:26:45,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:26:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 06:26:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:45,764 INFO L225 Difference]: With dead ends: 103 [2022-07-20 06:26:45,764 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 06:26:45,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:26:45,765 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 72 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:45,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:26:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 06:26:45,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 73. [2022-07-20 06:26:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4137931034482758) internal successors, (82), 72 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-07-20 06:26:45,768 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 28 [2022-07-20 06:26:45,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:45,768 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-07-20 06:26:45,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:45,768 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-07-20 06:26:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:26:45,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:45,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:45,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:45,992 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,SelfDestructingSolverStorable9 [2022-07-20 06:26:45,993 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:45,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:45,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1875687586, now seen corresponding path program 1 times [2022-07-20 06:26:45,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:45,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628908984] [2022-07-20 06:26:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:45,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:26:46,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:46,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628908984] [2022-07-20 06:26:46,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628908984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:26:46,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:26:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:26:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364483584] [2022-07-20 06:26:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:26:46,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:26:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:26:46,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:26:46,037 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:46,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:46,055 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-07-20 06:26:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:26:46,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:26:46,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:46,056 INFO L225 Difference]: With dead ends: 147 [2022-07-20 06:26:46,056 INFO L226 Difference]: Without dead ends: 147 [2022-07-20 06:26:46,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:26:46,057 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 86 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:46,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 161 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:26:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-20 06:26:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 74. [2022-07-20 06:26:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:46,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-20 06:26:46,060 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 29 [2022-07-20 06:26:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:46,061 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-20 06:26:46,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-20 06:26:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:26:46,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:46,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:46,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:26:46,062 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:46,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:46,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1668563827, now seen corresponding path program 1 times [2022-07-20 06:26:46,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:46,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30073651] [2022-07-20 06:26:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:46,110 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:46,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:46,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30073651] [2022-07-20 06:26:46,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30073651] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:46,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644641437] [2022-07-20 06:26:46,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:46,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:46,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:46,112 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) [2022-07-20 06:26:46,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:26:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:46,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:26:46,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:26:46,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:26:46,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644641437] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:26:46,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:26:46,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-07-20 06:26:46,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39419921] [2022-07-20 06:26:46,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:46,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:26:46,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:46,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:26:46,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:26:46,295 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:46,333 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-07-20 06:26:46,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:26:46,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 06:26:46,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:46,334 INFO L225 Difference]: With dead ends: 126 [2022-07-20 06:26:46,334 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 06:26:46,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:26:46,335 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 127 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:46,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 275 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:26:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 06:26:46,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2022-07-20 06:26:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.44) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:46,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2022-07-20 06:26:46,337 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 108 transitions. Word has length 33 [2022-07-20 06:26:46,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:46,337 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 108 transitions. [2022-07-20 06:26:46,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 108 transitions. [2022-07-20 06:26:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:26:46,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:46,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:46,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:46,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:46,555 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:46,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash -146010198, now seen corresponding path program 1 times [2022-07-20 06:26:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:46,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890007434] [2022-07-20 06:26:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:46,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890007434] [2022-07-20 06:26:46,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890007434] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:46,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686243592] [2022-07-20 06:26:46,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:46,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:46,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:46,777 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) [2022-07-20 06:26:46,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:26:46,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:46,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 06:26:46,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:46,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:46,943 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:26:46,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-20 06:26:47,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:47,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:47,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-20 06:26:47,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 9 [2022-07-20 06:26:47,232 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:47,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:55,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686243592] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:26:55,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:26:55,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-20 06:26:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009308828] [2022-07-20 06:26:55,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:26:55,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 06:26:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:26:55,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 06:26:55,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1066, Unknown=1, NotChecked=0, Total=1190 [2022-07-20 06:26:55,310 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:56,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:26:56,224 INFO L93 Difference]: Finished difference Result 176 states and 212 transitions. [2022-07-20 06:26:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:26:56,224 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:26:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:26:56,226 INFO L225 Difference]: With dead ends: 176 [2022-07-20 06:26:56,226 INFO L226 Difference]: Without dead ends: 176 [2022-07-20 06:26:56,227 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=538, Invalid=2011, Unknown=1, NotChecked=0, Total=2550 [2022-07-20 06:26:56,227 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1417 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:26:56,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 563 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 684 Invalid, 0 Unknown, 58 Unchecked, 0.3s Time] [2022-07-20 06:26:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-20 06:26:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 100. [2022-07-20 06:26:56,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 99 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 123 transitions. [2022-07-20 06:26:56,230 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 123 transitions. Word has length 34 [2022-07-20 06:26:56,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:26:56,230 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 123 transitions. [2022-07-20 06:26:56,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:26:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-07-20 06:26:56,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:26:56,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:26:56,231 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:26:56,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:26:56,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:56,443 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:26:56,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:26:56,444 INFO L85 PathProgramCache]: Analyzing trace with hash -146010197, now seen corresponding path program 1 times [2022-07-20 06:26:56,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:26:56,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097155460] [2022-07-20 06:26:56,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:56,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:26:56,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:56,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:26:56,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097155460] [2022-07-20 06:26:56,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097155460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:26:56,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906487347] [2022-07-20 06:26:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:26:56,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:26:56,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:26:56,854 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) [2022-07-20 06:26:56,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:26:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:26:56,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-20 06:26:56,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:26:56,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:57,093 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:26:57,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:57,109 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:26:57,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:57,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:57,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:26:57,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:57,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2022-07-20 06:26:57,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:26:57,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2022-07-20 06:26:57,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2022-07-20 06:26:57,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 14 [2022-07-20 06:26:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:26:57,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:26:59,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) is different from false [2022-07-20 06:27:01,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) is different from false [2022-07-20 06:27:03,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) is different from false [2022-07-20 06:27:05,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse0) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse0))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) is different from false [2022-07-20 06:27:05,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 [2022-07-20 06:27:05,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:05,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-07-20 06:27:05,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2022-07-20 06:27:05,974 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:05,975 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:06,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2022-07-20 06:27:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:27:06,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906487347] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:06,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:06,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 48 [2022-07-20 06:27:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041920451] [2022-07-20 06:27:06,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:06,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 06:27:06,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:06,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 06:27:06,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1853, Unknown=4, NotChecked=356, Total=2352 [2022-07-20 06:27:06,374 INFO L87 Difference]: Start difference. First operand 100 states and 123 transitions. Second operand has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:07,644 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#length| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse2 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 .cse0) (<= (+ .cse2 8) .cse3) (<= 8 .cse3) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-07-20 06:27:08,212 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select .cse0 .cse5)) (.cse2 (select .cse4 .cse5))) (and (<= 8 (select |c_#length| (select .cse0 4))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse2 8) (select |c_#length| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse3))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2022-07-20 06:27:08,681 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse5 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse1 (select .cse0 .cse5)) (.cse2 (select .cse4 .cse5))) (and (<= 8 (select |c_#length| (select .cse0 4))) (not (= .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ .cse2 8) (select |c_#length| .cse1)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse3) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse3))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select .cse4 4) 0)))) is different from false [2022-07-20 06:27:09,225 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|)) (.cse5 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse5)) (.cse4 (select .cse3 .cse5))) (and (= (select .cse0 4) 0) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 0 .cse1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse2) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse2))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|))) (<= 8 (select |c_#length| (select .cse3 4))) (<= (+ 8 .cse1) (select |c_#length| .cse4)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse4))))) is different from false [2022-07-20 06:27:09,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse5)) (.cse3 (select .cse0 .cse5))) (and (<= 8 (select |c_#length| (select .cse0 4))) (= (select .cse1 4) 0) (<= 0 .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ 8 .cse2) (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse4 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse4) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse4))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))))))))) is different from false [2022-07-20 06:27:10,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (.cse3 (select |c_#length| .cse4)) (.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse5))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (<= 0 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 8 |c_ULTIMATE.start_sll_create_~head~0#1.offset|) .cse0) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_15| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_15|) (and (forall ((v_ArrVal_604 Int) (v_ArrVal_601 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (<= (+ (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) .cse1) 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_604) .cse1))))) (forall ((v_ArrVal_601 Int)) (<= 0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_15| v_ArrVal_601) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))))))) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= .cse2 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 .cse0) (<= (+ .cse2 8) .cse3) (<= 8 .cse3) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 0 .cse2) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-07-20 06:27:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:11,239 INFO L93 Difference]: Finished difference Result 228 states and 283 transitions. [2022-07-20 06:27:11,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:27:11,240 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 06:27:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:11,241 INFO L225 Difference]: With dead ends: 228 [2022-07-20 06:27:11,241 INFO L226 Difference]: Without dead ends: 228 [2022-07-20 06:27:11,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=396, Invalid=3056, Unknown=10, NotChecked=1230, Total=4692 [2022-07-20 06:27:11,242 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 592 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 739 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:11,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1387 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 856 Invalid, 0 Unknown, 739 Unchecked, 0.5s Time] [2022-07-20 06:27:11,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-20 06:27:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 108. [2022-07-20 06:27:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 107 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 134 transitions. [2022-07-20 06:27:11,245 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 134 transitions. Word has length 34 [2022-07-20 06:27:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:11,246 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 134 transitions. [2022-07-20 06:27:11,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.0416666666666665) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 134 transitions. [2022-07-20 06:27:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:27:11,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:11,246 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:11,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:11,455 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,SelfDestructingSolverStorable13 [2022-07-20 06:27:11,455 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:11,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1013729350, now seen corresponding path program 2 times [2022-07-20 06:27:11,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:11,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521454871] [2022-07-20 06:27:11,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:11,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:27:11,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:11,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521454871] [2022-07-20 06:27:11,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521454871] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:11,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347778082] [2022-07-20 06:27:11,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:27:11,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:11,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:11,508 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) [2022-07-20 06:27:11,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:27:11,604 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:27:11,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:27:11,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:27:11,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:27:11,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:27:11,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347778082] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:11,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:11,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-07-20 06:27:11,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817286666] [2022-07-20 06:27:11,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:11,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:27:11,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:11,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:27:11,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:27:11,679 INFO L87 Difference]: Start difference. First operand 108 states and 134 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:11,725 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2022-07-20 06:27:11,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:27:11,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 06:27:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:11,726 INFO L225 Difference]: With dead ends: 100 [2022-07-20 06:27:11,726 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 06:27:11,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:27:11,726 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 203 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:11,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 136 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 06:27:11,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 94. [2022-07-20 06:27:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 93 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 113 transitions. [2022-07-20 06:27:11,729 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 113 transitions. Word has length 37 [2022-07-20 06:27:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:11,729 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 113 transitions. [2022-07-20 06:27:11,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-07-20 06:27:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:27:11,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:11,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:11,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:11,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-20 06:27:11,945 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1104183591, now seen corresponding path program 2 times [2022-07-20 06:27:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15478082] [2022-07-20 06:27:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:12,022 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:27:12,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:12,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15478082] [2022-07-20 06:27:12,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15478082] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:12,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726154875] [2022-07-20 06:27:12,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:27:12,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:12,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:12,024 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) [2022-07-20 06:27:12,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:27:12,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:27:12,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:27:12,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:27:12,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:27:12,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:12,171 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:27:12,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726154875] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:12,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:12,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-20 06:27:12,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020666318] [2022-07-20 06:27:12,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:12,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:27:12,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:12,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:27:12,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:27:12,173 INFO L87 Difference]: Start difference. First operand 94 states and 113 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:12,269 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-07-20 06:27:12,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:27:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 06:27:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:12,270 INFO L225 Difference]: With dead ends: 96 [2022-07-20 06:27:12,270 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 06:27:12,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:27:12,271 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:12,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 346 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 06:27:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-20 06:27:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.358974358974359) internal successors, (106), 89 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 106 transitions. [2022-07-20 06:27:12,273 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 106 transitions. Word has length 38 [2022-07-20 06:27:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:12,273 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 106 transitions. [2022-07-20 06:27:12,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 106 transitions. [2022-07-20 06:27:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 06:27:12,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:12,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:12,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:12,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:12,474 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:12,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:12,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1861613195, now seen corresponding path program 1 times [2022-07-20 06:27:12,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:12,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398426812] [2022-07-20 06:27:12,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:12,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:12,563 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:27:12,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:12,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398426812] [2022-07-20 06:27:12,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398426812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:12,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:12,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:27:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247083546] [2022-07-20 06:27:12,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:12,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:27:12,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:12,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:27:12,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:27:12,567 INFO L87 Difference]: Start difference. First operand 90 states and 106 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:12,728 INFO L93 Difference]: Finished difference Result 119 states and 133 transitions. [2022-07-20 06:27:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:27:12,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 06:27:12,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:12,729 INFO L225 Difference]: With dead ends: 119 [2022-07-20 06:27:12,729 INFO L226 Difference]: Without dead ends: 119 [2022-07-20 06:27:12,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:27:12,730 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 467 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:12,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 75 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:27:12,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-20 06:27:12,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2022-07-20 06:27:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 89 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2022-07-20 06:27:12,732 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 41 [2022-07-20 06:27:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:12,732 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2022-07-20 06:27:12,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 9 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2022-07-20 06:27:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 06:27:12,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:12,732 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:12,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:27:12,732 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1835573310, now seen corresponding path program 3 times [2022-07-20 06:27:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:12,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702270369] [2022-07-20 06:27:12,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:12,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:27:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:12,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702270369] [2022-07-20 06:27:12,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702270369] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:12,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461615983] [2022-07-20 06:27:12,786 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 06:27:12,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:12,800 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) [2022-07-20 06:27:12,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:27:12,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 06:27:12,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:27:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:27:12,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-20 06:27:12,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:27:12,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461615983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:12,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:27:12,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-07-20 06:27:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184768091] [2022-07-20 06:27:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:12,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:27:12,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:12,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:27:12,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:27:12,977 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:12,993 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2022-07-20 06:27:12,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:27:12,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 06:27:12,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:12,994 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:27:12,994 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:27:12,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:27:12,995 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:12,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 156 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:27:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-07-20 06:27:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-07-20 06:27:12,997 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 42 [2022-07-20 06:27:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:12,997 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-07-20 06:27:12,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-07-20 06:27:12,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-20 06:27:12,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:12,998 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:13,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:13,198 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,SelfDestructingSolverStorable17 [2022-07-20 06:27:13,198 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:13,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:13,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1595673087, now seen corresponding path program 1 times [2022-07-20 06:27:13,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:13,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351312398] [2022-07-20 06:27:13,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:13,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:27:13,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:13,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351312398] [2022-07-20 06:27:13,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351312398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:13,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:13,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:27:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345551363] [2022-07-20 06:27:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:13,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:27:13,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:13,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:27:13,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:27:13,229 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:13,243 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-07-20 06:27:13,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:27:13,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-20 06:27:13,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:13,244 INFO L225 Difference]: With dead ends: 81 [2022-07-20 06:27:13,244 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 06:27:13,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:27:13,245 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 19 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:13,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 149 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 06:27:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-07-20 06:27:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:13,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-20 06:27:13,247 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 44 [2022-07-20 06:27:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:13,247 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-20 06:27:13,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-20 06:27:13,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 06:27:13,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:13,248 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:13,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:27:13,248 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:13,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2124312202, now seen corresponding path program 1 times [2022-07-20 06:27:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:13,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349179117] [2022-07-20 06:27:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:13,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:13,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:13,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349179117] [2022-07-20 06:27:13,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349179117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:13,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566770720] [2022-07-20 06:27:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:13,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:13,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:13,744 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) [2022-07-20 06:27:13,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:27:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:13,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-20 06:27:13,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:13,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:13,989 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:27:13,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:14,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:14,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-20 06:27:14,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:27:14,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:14,396 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-07-20 06:27:14,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:14,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:14,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:14,844 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:27:14,852 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:27:14,859 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|))) is different from false [2022-07-20 06:27:14,868 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1120 (Array Int Int))) (<= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1120 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_1120) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-20 06:27:14,878 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:14,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-20 06:27:14,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:14,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 61 [2022-07-20 06:27:14,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 21 [2022-07-20 06:27:14,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:14,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-20 06:27:14,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-07-20 06:27:14,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 21 [2022-07-20 06:27:15,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-20 06:27:15,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566770720] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:15,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:15,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 66 [2022-07-20 06:27:15,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139904139] [2022-07-20 06:27:15,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:15,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-20 06:27:15,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:15,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-20 06:27:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=3573, Unknown=4, NotChecked=492, Total=4290 [2022-07-20 06:27:15,374 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:16,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:16,749 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-20 06:27:16,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 06:27:16,749 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-20 06:27:16,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:16,750 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:27:16,750 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 06:27:16,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 90 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=864, Invalid=6804, Unknown=4, NotChecked=700, Total=8372 [2022-07-20 06:27:16,752 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 395 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:16,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 746 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 952 Invalid, 0 Unknown, 342 Unchecked, 0.4s Time] [2022-07-20 06:27:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 06:27:16,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 79. [2022-07-20 06:27:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:16,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-20 06:27:16,753 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 45 [2022-07-20 06:27:16,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:16,754 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-20 06:27:16,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.8484848484848484) internal successors, (122), 66 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-20 06:27:16,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:27:16,754 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:16,754 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:16,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 06:27:16,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:16,963 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:16,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:16,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429550, now seen corresponding path program 1 times [2022-07-20 06:27:16,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:16,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942461629] [2022-07-20 06:27:16,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:16,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:17,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942461629] [2022-07-20 06:27:17,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942461629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:17,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487547460] [2022-07-20 06:27:17,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:17,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:17,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:17,531 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) [2022-07-20 06:27:17,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:27:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:17,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-20 06:27:17,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:17,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:17,769 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:27:17,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:17,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:18,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 21 [2022-07-20 06:27:18,209 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:27:18,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 35 [2022-07-20 06:27:18,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-07-20 06:27:18,318 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:27:18,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:18,413 INFO L356 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-07-20 06:27:18,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 20 [2022-07-20 06:27:18,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-07-20 06:27:18,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) is different from false [2022-07-20 06:27:18,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-07-20 06:27:18,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2022-07-20 06:27:18,444 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (v_ArrVal_1229 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1229))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2022-07-20 06:27:18,454 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2022-07-20 06:27:18,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2022-07-20 06:27:18,469 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) is different from false [2022-07-20 06:27:18,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) is different from false [2022-07-20 06:27:18,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:18,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 53 treesize of output 51 [2022-07-20 06:27:18,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:18,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:18,499 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:18,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 31 [2022-07-20 06:27:18,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2022-07-20 06:27:18,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:27:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-07-20 06:27:18,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487547460] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:18,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 60 [2022-07-20 06:27:18,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42170311] [2022-07-20 06:27:18,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:18,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-20 06:27:18,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:18,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-20 06:27:18,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2528, Unknown=9, NotChecked=972, Total=3660 [2022-07-20 06:27:18,643 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:19,163 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-20 06:27:19,166 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:19,195 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2)))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:19,216 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1))) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) is different from false [2022-07-20 06:27:19,221 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-07-20 06:27:19,383 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1230 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_27| Int) (v_ArrVal_1229 Int)) (or (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_27| v_ArrVal_1229)) (.cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse2 .cse3))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_1230) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse3)))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_27|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-20 06:27:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:20,234 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2022-07-20 06:27:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 06:27:20,235 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-20 06:27:20,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:20,235 INFO L225 Difference]: With dead ends: 128 [2022-07-20 06:27:20,235 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 06:27:20,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=568, Invalid=5177, Unknown=15, NotChecked=2430, Total=8190 [2022-07-20 06:27:20,237 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 597 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:20,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [597 Valid, 1068 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1599 Invalid, 0 Unknown, 880 Unchecked, 0.6s Time] [2022-07-20 06:27:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 06:27:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2022-07-20 06:27:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-20 06:27:20,240 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 51 [2022-07-20 06:27:20,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:20,240 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-20 06:27:20,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 2.3) internal successors, (138), 61 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-20 06:27:20,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:27:20,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:20,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:20,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:20,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 06:27:20,451 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429551, now seen corresponding path program 1 times [2022-07-20 06:27:20,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:20,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456963762] [2022-07-20 06:27:20,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:20,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:21,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:21,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456963762] [2022-07-20 06:27:21,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456963762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:21,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610952295] [2022-07-20 06:27:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:21,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:21,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:21,213 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) [2022-07-20 06:27:21,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:27:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:21,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-20 06:27:21,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:21,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:21,457 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:27:21,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:21,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:21,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 21 [2022-07-20 06:27:21,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:21,817 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:27:21,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-20 06:27:21,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2022-07-20 06:27:21,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2022-07-20 06:27:21,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 14 [2022-07-20 06:27:22,045 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:27:22,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:22,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:22,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 51 [2022-07-20 06:27:22,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 144 treesize of output 132 [2022-07-20 06:27:22,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 110 treesize of output 102 [2022-07-20 06:27:22,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 75 treesize of output 67 [2022-07-20 06:27:22,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-07-20 06:27:23,206 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))))) is different from false [2022-07-20 06:27:23,499 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) is different from false [2022-07-20 06:27:23,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) is different from false [2022-07-20 06:27:23,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 [2022-07-20 06:27:23,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2022-07-20 06:27:23,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610952295] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:23,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:23,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 20, 21] total 62 [2022-07-20 06:27:23,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624890750] [2022-07-20 06:27:23,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:23,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-20 06:27:23,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:23,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-20 06:27:23,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3261, Unknown=4, NotChecked=468, Total=3906 [2022-07-20 06:27:23,912 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 63 states, 62 states have (on average 2.274193548387097) internal successors, (141), 63 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:24,712 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-20 06:27:25,007 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:25,297 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:25,613 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))))) is different from false [2022-07-20 06:27:25,905 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2022-07-20 06:27:26,349 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_1340 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_30| Int)) (or (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_30|) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_30| v_ArrVal_1340) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))) is different from false [2022-07-20 06:27:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:27,307 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2022-07-20 06:27:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 06:27:27,309 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.274193548387097) internal successors, (141), 63 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-20 06:27:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:27,309 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:27:27,309 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:27:27,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=636, Invalid=6534, Unknown=10, NotChecked=1750, Total=8930 [2022-07-20 06:27:27,311 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 800 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:27,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1197 Invalid, 2206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1389 Invalid, 0 Unknown, 716 Unchecked, 0.5s Time] [2022-07-20 06:27:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:27:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 82. [2022-07-20 06:27:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:27,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-07-20 06:27:27,325 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 51 [2022-07-20 06:27:27,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:27,325 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-07-20 06:27:27,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.274193548387097) internal successors, (141), 63 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-07-20 06:27:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-20 06:27:27,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:27,326 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:27,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:27,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-20 06:27:27,539 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1599429606, now seen corresponding path program 1 times [2022-07-20 06:27:27,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:27,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160166908] [2022-07-20 06:27:27,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:27,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:27,590 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:27:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:27,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160166908] [2022-07-20 06:27:27,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160166908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:27,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170999500] [2022-07-20 06:27:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:27,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:27,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:27,593 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) [2022-07-20 06:27:27,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:27:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:27,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:27:27,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:27,745 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:27:27,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:27:27,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170999500] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:27,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:27,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-20 06:27:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481665468] [2022-07-20 06:27:27,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:27,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:27:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:27,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:27:27,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:27:27,786 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:27,833 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2022-07-20 06:27:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:27:27,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-20 06:27:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:27,834 INFO L225 Difference]: With dead ends: 73 [2022-07-20 06:27:27,834 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 06:27:27,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:27:27,835 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:27,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 175 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 06:27:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-20 06:27:27,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 72 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2022-07-20 06:27:27,838 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 51 [2022-07-20 06:27:27,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:27,838 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2022-07-20 06:27:27,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:27,838 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2022-07-20 06:27:27,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 06:27:27,838 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:27,839 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:27,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:28,056 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,SelfDestructingSolverStorable22 [2022-07-20 06:27:28,056 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:28,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:28,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2007861849, now seen corresponding path program 1 times [2022-07-20 06:27:28,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:28,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465191607] [2022-07-20 06:27:28,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:28,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:28,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:28,109 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:27:28,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:28,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465191607] [2022-07-20 06:27:28,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465191607] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:28,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454451634] [2022-07-20 06:27:28,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:28,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:28,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:28,111 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) [2022-07-20 06:27:28,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 06:27:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:28,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:27:28,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:27:28,295 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 06:27:28,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454451634] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:28,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:28,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-07-20 06:27:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312668237] [2022-07-20 06:27:28,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:28,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:27:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:28,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:27:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:27:28,309 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:28,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:28,342 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-07-20 06:27:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:27:28,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-20 06:27:28,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:28,346 INFO L225 Difference]: With dead ends: 73 [2022-07-20 06:27:28,346 INFO L226 Difference]: Without dead ends: 73 [2022-07-20 06:27:28,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:27:28,347 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 72 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:28,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:28,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-20 06:27:28,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-20 06:27:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.121212121212121) internal successors, (74), 72 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2022-07-20 06:27:28,349 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 52 [2022-07-20 06:27:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:28,349 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2022-07-20 06:27:28,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-07-20 06:27:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-20 06:27:28,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:28,350 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:28,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:28,567 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 [2022-07-20 06:27:28,568 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:28,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:28,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1192937808, now seen corresponding path program 1 times [2022-07-20 06:27:28,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:28,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703742981] [2022-07-20 06:27:28,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:28,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:29,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703742981] [2022-07-20 06:27:29,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703742981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:29,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829406275] [2022-07-20 06:27:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:29,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:29,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:29,145 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) [2022-07-20 06:27:29,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 06:27:29,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:29,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 101 conjunts are in the unsatisfiable core [2022-07-20 06:27:29,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:29,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:29,328 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:27:29,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:29,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:29,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:29,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 21 [2022-07-20 06:27:29,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:29,651 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:27:29,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 63 [2022-07-20 06:27:29,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 21 [2022-07-20 06:27:29,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-07-20 06:27:29,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 39 treesize of output 21 [2022-07-20 06:27:29,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 11 [2022-07-20 06:27:29,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 06:27:29,933 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:29,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:30,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 86 treesize of output 64 [2022-07-20 06:27:30,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 86 treesize of output 64 [2022-07-20 06:27:30,187 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1661 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_~head#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-20 06:27:30,200 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1664 (Array Int Int))) (= |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (forall ((v_ArrVal_1661 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.offset|)) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-20 06:27:30,208 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (<= |c_ULTIMATE.start_sll_update_at_~data#1| .cse0) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) .cse1) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse2 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= .cse0 |c_ULTIMATE.start_sll_update_at_~data#1|))) is different from false [2022-07-20 06:27:30,221 WARN L833 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-07-20 06:27:30,228 WARN L833 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|) (forall ((v_ArrVal_1661 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) v_ArrVal_1661) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0)))) (forall ((v_ArrVal_1664 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1))))) is different from false [2022-07-20 06:27:30,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 254 treesize of output 230 [2022-07-20 06:27:30,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 194 treesize of output 178 [2022-07-20 06:27:30,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 178 treesize of output 162 [2022-07-20 06:27:30,280 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))))) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (or (= |c_ULTIMATE.start_sll_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3) (<= |c_ULTIMATE.start_main_~i~0#1| 0) .cse3 (<= 0 |c_ULTIMATE.start_main_~i~0#1|))) is different from false [2022-07-20 06:27:30,288 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_1660)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-07-20 06:27:32,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) is different from false [2022-07-20 06:27:34,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))))))) is different from false [2022-07-20 06:27:36,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) is different from false [2022-07-20 06:27:38,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) is different from false [2022-07-20 06:27:38,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:38,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 53 treesize of output 51 [2022-07-20 06:27:38,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:38,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:38,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:38,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 31 [2022-07-20 06:27:38,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 24 [2022-07-20 06:27:38,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 06:27:38,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 16 [2022-07-20 06:27:38,414 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:38,580 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-07-20 06:27:38,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829406275] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:38,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:38,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 29] total 65 [2022-07-20 06:27:38,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561024147] [2022-07-20 06:27:38,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:38,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-20 06:27:38,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:38,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-20 06:27:38,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=2721, Unknown=11, NotChecked=1254, Total=4160 [2022-07-20 06:27:38,582 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand has 65 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:39,002 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-07-20 06:27:41,006 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:43,009 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select .cse1 .cse2))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse2))))) (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:43,033 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|) (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_#res#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))))))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0)) is different from false [2022-07-20 06:27:43,037 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) (<= |c_ULTIMATE.start_main_~i~0#1| 0) (<= 0 |c_ULTIMATE.start_main_~i~0#1|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|)))) is different from false [2022-07-20 06:27:43,261 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_33| Int)) (or (and (forall ((v_ArrVal_1660 Int) (v_ArrVal_1664 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660)) (.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse1 (select .cse0 .cse2))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) .cse1 v_ArrVal_1664) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) .cse1)))) (forall ((v_ArrVal_1660 Int)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_33| v_ArrVal_1660) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_33|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-07-20 06:27:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:44,333 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2022-07-20 06:27:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 06:27:44,333 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2022-07-20 06:27:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:44,334 INFO L225 Difference]: With dead ends: 78 [2022-07-20 06:27:44,334 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 06:27:44,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 71 SyntacticMatches, 9 SemanticMatches, 91 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=496, Invalid=5255, Unknown=17, NotChecked=2788, Total=8556 [2022-07-20 06:27:44,335 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 226 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 2007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 730 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:44,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 874 Invalid, 2007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1221 Invalid, 0 Unknown, 730 Unchecked, 0.6s Time] [2022-07-20 06:27:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 06:27:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-07-20 06:27:44,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 65 states have (on average 1.1076923076923078) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-07-20 06:27:44,337 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 55 [2022-07-20 06:27:44,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:44,337 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-07-20 06:27:44,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.123076923076923) internal successors, (138), 65 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-07-20 06:27:44,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:27:44,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:44,337 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:44,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:44,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:44,539 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:44,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:44,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341834, now seen corresponding path program 1 times [2022-07-20 06:27:44,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:44,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867599110] [2022-07-20 06:27:44,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:44,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:44,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-20 06:27:44,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:44,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867599110] [2022-07-20 06:27:44,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867599110] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:44,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653872493] [2022-07-20 06:27:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:44,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:44,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:44,601 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) [2022-07-20 06:27:44,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 06:27:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:44,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:27:44,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-20 06:27:44,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:27:44,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653872493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:44,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:27:44,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2022-07-20 06:27:44,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061817360] [2022-07-20 06:27:44,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:44,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:27:44,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:44,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:27:44,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:27:44,798 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:44,888 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2022-07-20 06:27:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:27:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-20 06:27:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:44,889 INFO L225 Difference]: With dead ends: 82 [2022-07-20 06:27:44,889 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 06:27:44,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:27:44,889 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 144 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:44,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 107 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:27:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 06:27:44,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2022-07-20 06:27:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.1194029850746268) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:44,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-07-20 06:27:44,891 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 59 [2022-07-20 06:27:44,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:44,891 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-07-20 06:27:44,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.833333333333333) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-07-20 06:27:44,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-20 06:27:44,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:44,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:44,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:45,099 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,SelfDestructingSolverStorable25 [2022-07-20 06:27:45,099 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:45,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341833, now seen corresponding path program 1 times [2022-07-20 06:27:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:45,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634391887] [2022-07-20 06:27:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:27:45,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:45,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634391887] [2022-07-20 06:27:45,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634391887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:45,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:45,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:27:45,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948453195] [2022-07-20 06:27:45,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:45,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:27:45,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:45,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:27:45,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:27:45,189 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:45,360 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-20 06:27:45,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:27:45,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-20 06:27:45,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:45,361 INFO L225 Difference]: With dead ends: 80 [2022-07-20 06:27:45,361 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 06:27:45,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:27:45,362 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 283 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:45,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 52 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:27:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 06:27:45,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2022-07-20 06:27:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 73 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2022-07-20 06:27:45,363 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 59 [2022-07-20 06:27:45,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:45,363 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2022-07-20 06:27:45,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.875) internal successors, (47), 9 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,363 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2022-07-20 06:27:45,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-20 06:27:45,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:45,364 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:45,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 06:27:45,364 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:45,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:45,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1658827190, now seen corresponding path program 1 times [2022-07-20 06:27:45,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:45,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684997530] [2022-07-20 06:27:45,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:45,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:45,417 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:27:45,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:45,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684997530] [2022-07-20 06:27:45,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684997530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:45,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:45,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:27:45,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675180380] [2022-07-20 06:27:45,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:45,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:27:45,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:45,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:27:45,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:27:45,419 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:45,520 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-07-20 06:27:45,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:27:45,521 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2022-07-20 06:27:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:45,521 INFO L225 Difference]: With dead ends: 77 [2022-07-20 06:27:45,521 INFO L226 Difference]: Without dead ends: 77 [2022-07-20 06:27:45,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:27:45,522 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 265 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:45,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 81 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:45,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-20 06:27:45,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-07-20 06:27:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 73 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2022-07-20 06:27:45,524 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 60 [2022-07-20 06:27:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:45,524 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2022-07-20 06:27:45,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2022-07-20 06:27:45,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 06:27:45,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:45,525 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:45,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 06:27:45,525 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:45,526 INFO L85 PathProgramCache]: Analyzing trace with hash -698613301, now seen corresponding path program 1 times [2022-07-20 06:27:45,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:45,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24264206] [2022-07-20 06:27:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:45,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-20 06:27:45,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:45,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24264206] [2022-07-20 06:27:45,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24264206] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:45,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:45,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:27:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244578273] [2022-07-20 06:27:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:45,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:27:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:27:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:27:45,584 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:45,706 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-20 06:27:45,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:27:45,706 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-20 06:27:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:45,706 INFO L225 Difference]: With dead ends: 75 [2022-07-20 06:27:45,706 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 06:27:45,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:27:45,707 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:45,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 65 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:27:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 06:27:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-20 06:27:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-20 06:27:45,708 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 62 [2022-07-20 06:27:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:45,709 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-20 06:27:45,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-20 06:27:45,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 06:27:45,709 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:45,709 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:45,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 06:27:45,709 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:45,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827867, now seen corresponding path program 1 times [2022-07-20 06:27:45,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:45,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889433615] [2022-07-20 06:27:45,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:45,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:46,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:27:46,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:46,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889433615] [2022-07-20 06:27:46,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889433615] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:46,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423466713] [2022-07-20 06:27:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:46,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:46,024 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) [2022-07-20 06:27:46,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 06:27:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:46,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-20 06:27:46,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:46,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:46,209 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:27:46,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:46,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:46,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:46,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-20 06:27:46,373 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:27:46,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:27:46,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:46,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-20 06:27:46,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:27:46,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:46,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:46,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 31 treesize of output 35 [2022-07-20 06:27:46,724 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_~head#1.base|)) (forall ((v_prenex_2 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-07-20 06:27:46,731 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2036 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base|))) is different from false [2022-07-20 06:27:46,736 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_prenex_2 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-07-20 06:27:46,743 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2036 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_prenex_2 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_2) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))) is different from false [2022-07-20 06:27:46,755 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2035)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2035)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-07-20 06:27:46,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (and (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) is different from false [2022-07-20 06:27:46,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (and (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_ULTIMATE.start_sll_create_#res#1.base|)))))) is different from false [2022-07-20 06:27:46,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (and (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_2)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))) is different from false [2022-07-20 06:27:46,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (and (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) is different from false [2022-07-20 06:27:46,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:46,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 38 treesize of output 38 [2022-07-20 06:27:46,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:46,848 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:46,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:46,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 30 [2022-07-20 06:27:46,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:46,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2022-07-20 06:27:46,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 18 [2022-07-20 06:27:46,872 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-07-20 06:27:46,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 51 treesize of output 1 [2022-07-20 06:27:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-20 06:27:46,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423466713] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:46,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:46,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 23] total 48 [2022-07-20 06:27:46,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497143887] [2022-07-20 06:27:46,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:46,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 06:27:46,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:46,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 06:27:46,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1461, Unknown=9, NotChecked=756, Total=2352 [2022-07-20 06:27:46,975 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:47,227 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (and (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-07-20 06:27:49,229 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (and (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_2)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:51,232 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (and (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))) (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~head~0#1.base| (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_prenex_2)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))) (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)) is different from false [2022-07-20 06:27:51,250 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|) (and (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_#res#1.base|) 4))))) (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_ULTIMATE.start_sll_create_#res#1.base|))))))) is different from false [2022-07-20 06:27:51,255 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (and (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0)) is different from false [2022-07-20 06:27:51,361 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_36| Int)) (or (and (forall ((v_ArrVal_2035 Int) (v_prenex_2 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_prenex_2)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) (forall ((v_ArrVal_2035 Int) (v_ArrVal_2036 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_36| v_ArrVal_2035))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) .cse1 v_ArrVal_2036) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_36|))) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)) is different from false [2022-07-20 06:27:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:51,816 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-07-20 06:27:51,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 06:27:51,816 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-20 06:27:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:51,817 INFO L225 Difference]: With dead ends: 89 [2022-07-20 06:27:51,817 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 06:27:51,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=343, Invalid=2894, Unknown=15, NotChecked=1860, Total=5112 [2022-07-20 06:27:51,818 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 223 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 648 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:51,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 627 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 883 Invalid, 0 Unknown, 648 Unchecked, 0.3s Time] [2022-07-20 06:27:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 06:27:51,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2022-07-20 06:27:51,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.1095890410958904) internal successors, (81), 77 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:51,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 81 transitions. [2022-07-20 06:27:51,819 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 81 transitions. Word has length 65 [2022-07-20 06:27:51,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:51,820 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 81 transitions. [2022-07-20 06:27:51,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.5625) internal successors, (123), 49 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 81 transitions. [2022-07-20 06:27:51,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 06:27:51,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:51,820 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:51,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:27:52,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:52,021 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:27:52,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:52,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1022827868, now seen corresponding path program 1 times [2022-07-20 06:27:52,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:52,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856076949] [2022-07-20 06:27:52,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:52,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:52,903 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:27:52,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:52,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856076949] [2022-07-20 06:27:52,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856076949] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:27:52,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975164608] [2022-07-20 06:27:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:52,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:27:52,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:52,906 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) [2022-07-20 06:27:52,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 06:27:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:53,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 106 conjunts are in the unsatisfiable core [2022-07-20 06:27:53,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:27:53,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:53,269 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:27:53,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:53,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:53,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:53,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:27:53,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:53,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 06:27:53,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:53,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 24 [2022-07-20 06:27:53,872 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:27:53,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 41 [2022-07-20 06:27:53,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:53,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:27:54,171 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-20 06:27:54,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2022-07-20 06:27:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 06:27:54,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:27:54,628 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) is different from false [2022-07-20 06:27:54,643 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-20 06:27:54,648 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))) is different from false [2022-07-20 06:27:54,655 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-07-20 06:27:54,692 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2151)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2150)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2150)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))) is different from false [2022-07-20 06:27:54,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) is different from false [2022-07-20 06:27:54,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4)))))) is different from false [2022-07-20 06:27:54,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))))) is different from false [2022-07-20 06:27:54,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) is different from false [2022-07-20 06:27:54,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:54,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 81 [2022-07-20 06:27:54,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 62 treesize of output 60 [2022-07-20 06:27:54,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:54,826 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:54,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2022-07-20 06:27:54,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2022-07-20 06:27:54,844 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 80 [2022-07-20 06:27:54,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-07-20 06:27:54,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 28 [2022-07-20 06:27:54,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:54,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:27:54,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-07-20 06:27:54,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-07-20 06:27:54,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:54,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:27:54,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:27:54,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2022-07-20 06:27:55,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 50 treesize of output 46 [2022-07-20 06:27:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-20 06:27:55,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975164608] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:27:55,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:27:55,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 25, 24] total 76 [2022-07-20 06:27:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838902271] [2022-07-20 06:27:55,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:27:55,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-07-20 06:27:55,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-07-20 06:27:55,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=4311, Unknown=9, NotChecked=1260, Total=5852 [2022-07-20 06:27:55,560 INFO L87 Difference]: Start difference. First operand 78 states and 81 transitions. Second operand has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:56,093 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (<= (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-20 06:27:58,097 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (and (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse1 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (<= 8 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2022-07-20 06:28:00,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3))) (and (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse1 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse1 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse2) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse3) 0) (<= 8 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0)))) is different from false [2022-07-20 06:28:00,133 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|) (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse1 (select .cse2 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse1 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse2) .cse1 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 4)))))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= 8 (select |c_#length| .cse0)))) is different from false [2022-07-20 06:28:00,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (let ((.cse1 (<= 8 (select |c_#length| .cse4))) (.cse0 (= |c_ULTIMATE.start_main_~s~0#1.base| .cse4))) (and (not .cse0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (or .cse1 .cse0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse2 v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse2 v_ArrVal_2154) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 4)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|)))))) is different from false [2022-07-20 06:28:00,367 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_node_create_#res#1.base|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_39| Int)) (or (and (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 4))) (forall ((v_ArrVal_2151 Int) (v_ArrVal_2150 Int) (v_ArrVal_2155 (Array Int Int)) (v_ArrVal_2154 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2150))) (let ((.cse0 (select .cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_39| v_ArrVal_2151)) .cse0 v_ArrVal_2155) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) .cse0 v_ArrVal_2154) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))))) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_39|))) (<= (+ 8 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (select |c_#length| |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse2) 0) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= 8 (select |c_#length| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= 8 (select |c_#length| .cse3)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-20 06:28:01,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:01,547 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2022-07-20 06:28:01,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 06:28:01,547 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-20 06:28:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:01,548 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:28:01,548 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:28:01,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 108 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1658 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=806, Invalid=8167, Unknown=17, NotChecked=3000, Total=11990 [2022-07-20 06:28:01,549 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 289 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 2144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:01,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 803 Invalid, 2144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1372 Invalid, 0 Unknown, 716 Unchecked, 0.5s Time] [2022-07-20 06:28:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:28:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2022-07-20 06:28:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 79 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-07-20 06:28:01,550 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 65 [2022-07-20 06:28:01,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:01,550 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-07-20 06:28:01,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 76 states have (on average 2.3289473684210527) internal successors, (177), 77 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-07-20 06:28:01,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 06:28:01,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:01,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:01,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-20 06:28:01,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:01,752 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:28:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:01,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1642891397, now seen corresponding path program 1 times [2022-07-20 06:28:01,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:01,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16111168] [2022-07-20 06:28:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:28:02,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:02,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16111168] [2022-07-20 06:28:02,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16111168] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:02,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370151593] [2022-07-20 06:28:02,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:02,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:02,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:02,395 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) [2022-07-20 06:28:02,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 06:28:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:02,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-20 06:28:02,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:02,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:03,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:03,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2022-07-20 06:28:03,399 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:28:03,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 56 [2022-07-20 06:28:03,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:03,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 42 treesize of output 30 [2022-07-20 06:28:03,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:03,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-07-20 06:28:04,330 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:28:04,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:05,062 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int))) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|))) (= (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-07-20 06:28:05,076 WARN L833 $PredicateComparison]: unable to prove that (or (= (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_21| Int)) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |v_ULTIMATE.start_main_~s~0#1.offset_21| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (not (<= |v_ULTIMATE.start_main_~s~0#1.offset_21| |c_ULTIMATE.start_sll_create_#res#1.offset|)) (< |v_ULTIMATE.start_main_~s~0#1.offset_21| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)))) is different from false [2022-07-20 06:28:05,089 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_21| Int)) (or (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_21|) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (< |v_ULTIMATE.start_main_~s~0#1.offset_21| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|) (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ |v_ULTIMATE.start_main_~s~0#1.offset_21| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)))) (= (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-07-20 06:28:05,124 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_42| Int) (v_ArrVal_2266 Int) (v_ArrVal_2268 (Array Int Int)) (|v_ULTIMATE.start_main_~s~0#1.offset_21| Int)) (or (not (= (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_42| v_ArrVal_2266))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |v_ULTIMATE.start_main_~s~0#1.offset_21| 4)) v_ArrVal_2268)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)) (not (<= 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|)) (< |v_ULTIMATE.start_main_~s~0#1.offset_21| |v_ULTIMATE.start_sll_update_at_~head#1.offset_42|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~s~0#1.offset_21|))) (= |c_ULTIMATE.start_main_old_#valid#1| (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0))) is different from false [2022-07-20 06:28:05,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:05,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 38 treesize of output 38 [2022-07-20 06:28:05,149 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:05,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:05,151 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:05,162 INFO L356 Elim1Store]: treesize reduction 22, result has 60.7 percent of original size [2022-07-20 06:28:05,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 59 treesize of output 74 [2022-07-20 06:28:05,179 INFO L356 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2022-07-20 06:28:05,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 88 [2022-07-20 06:28:05,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 54 [2022-07-20 06:28:05,742 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2022-07-20 06:28:05,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370151593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:05,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:05,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 25] total 79 [2022-07-20 06:28:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244781841] [2022-07-20 06:28:05,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:05,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-20 06:28:05,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:05,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-20 06:28:05,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=5254, Unknown=16, NotChecked=596, Total=6162 [2022-07-20 06:28:05,745 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 79 states, 79 states have (on average 2.2911392405063293) internal successors, (181), 79 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:08,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:08,736 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2022-07-20 06:28:08,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-20 06:28:08,736 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 2.2911392405063293) internal successors, (181), 79 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-07-20 06:28:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:08,737 INFO L225 Difference]: With dead ends: 132 [2022-07-20 06:28:08,737 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 06:28:08,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 93 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 4 IntricatePredicates, 4 DeprecatedPredicates, 2603 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=780, Invalid=12318, Unknown=28, NotChecked=916, Total=14042 [2022-07-20 06:28:08,738 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 82 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:08,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 881 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 225 Unchecked, 0.0s Time] [2022-07-20 06:28:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 06:28:08,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 80. [2022-07-20 06:28:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.08) internal successors, (81), 79 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:08,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-07-20 06:28:08,740 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 66 [2022-07-20 06:28:08,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:08,740 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-07-20 06:28:08,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 2.2911392405063293) internal successors, (181), 79 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:08,741 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-07-20 06:28:08,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-20 06:28:08,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:08,741 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:08,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-20 06:28:08,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:08,955 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:28:08,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:08,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1727882938, now seen corresponding path program 1 times [2022-07-20 06:28:08,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:08,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897901102] [2022-07-20 06:28:08,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:08,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:28:09,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:09,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897901102] [2022-07-20 06:28:09,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897901102] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:09,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251721779] [2022-07-20 06:28:09,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:09,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:09,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:09,693 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:09,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 06:28:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:09,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-20 06:28:09,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:09,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:09,996 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:28:09,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:10,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:10,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:10,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-20 06:28:10,334 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:10,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:28:10,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:10,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-20 06:28:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-20 06:28:10,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:10,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:10,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_#t~mem10#1.base| v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:10,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_update_at_~head#1.offset| 4)) v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:10,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2381 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:10,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (v_ArrVal_2381 (Array Int Int))) (< (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_update_at_~head#1.base|) |c_ULTIMATE.start_sll_update_at_~head#1.offset| v_ArrVal_2379)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:10,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-20 06:28:10,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-20 06:28:10,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-20 06:28:10,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) is different from false [2022-07-20 06:28:10,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:10,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 06:28:10,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:10,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:10,724 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:10,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2022-07-20 06:28:10,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:10,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2022-07-20 06:28:10,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 06:28:11,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-20 06:28:11,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251721779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:11,003 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:11,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 22, 23] total 64 [2022-07-20 06:28:11,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661350133] [2022-07-20 06:28:11,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:11,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-20 06:28:11,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:11,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-20 06:28:11,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2876, Unknown=9, NotChecked=1044, Total=4160 [2022-07-20 06:28:11,004 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 65 states, 64 states have (on average 2.5625) internal successors, (164), 65 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:11,627 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (< |c_ULTIMATE.start_node_create_#res#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-20 06:28:11,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (< .cse0 |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= (+ (select .cse2 4) 1) |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:28:11,633 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (let ((.cse0 (select .cse2 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)))) (and (< .cse0 |c_#StackHeapBarrier|) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (<= (+ (select .cse2 4) 1) |c_#StackHeapBarrier|)))) is different from false [2022-07-20 06:28:11,670 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_sll_create_#res#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_#res#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse1)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (<= (+ 1 .cse1) |c_#StackHeapBarrier|) (< .cse1 |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:28:11,674 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (< .cse0 |c_#StackHeapBarrier|))) is different from false [2022-07-20 06:28:11,901 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1))) (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~head~0#1.base| |c_#StackHeapBarrier|) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse1)) (forall ((v_ArrVal_2379 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_45| Int) (v_ArrVal_2381 (Array Int Int))) (or (< (select (select (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_45| v_ArrVal_2379))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (select .cse2 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) v_ArrVal_2381)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_update_at_~head#1.offset_45|))) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base|) 1) (<= (+ |c_ULTIMATE.start_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0)) (< .cse0 |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (< |c_ULTIMATE.start_node_create_#res#1.base| |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (< |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ |c_ULTIMATE.start_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1)))) is different from false [2022-07-20 06:28:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:13,055 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2022-07-20 06:28:13,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 06:28:13,055 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 2.5625) internal successors, (164), 65 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2022-07-20 06:28:13,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:13,056 INFO L225 Difference]: With dead ends: 88 [2022-07-20 06:28:13,056 INFO L226 Difference]: Without dead ends: 88 [2022-07-20 06:28:13,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 95 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=725, Invalid=5961, Unknown=16, NotChecked=2610, Total=9312 [2022-07-20 06:28:13,057 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 356 mSDsluCounter, 864 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 848 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:13,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 893 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1318 Invalid, 0 Unknown, 848 Unchecked, 0.6s Time] [2022-07-20 06:28:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-20 06:28:13,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2022-07-20 06:28:13,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 80 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2022-07-20 06:28:13,058 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 68 [2022-07-20 06:28:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:13,059 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2022-07-20 06:28:13,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 2.5625) internal successors, (164), 65 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:13,059 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-07-20 06:28:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-20 06:28:13,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:13,059 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:13,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:13,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:13,266 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:28:13,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:13,266 INFO L85 PathProgramCache]: Analyzing trace with hash -177401856, now seen corresponding path program 2 times [2022-07-20 06:28:13,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:13,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942333553] [2022-07-20 06:28:13,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:13,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:14,067 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-20 06:28:14,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:14,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942333553] [2022-07-20 06:28:14,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942333553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:14,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434604669] [2022-07-20 06:28:14,068 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:28:14,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:14,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:14,069 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:14,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 06:28:14,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:28:14,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:28:14,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-20 06:28:14,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:14,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:14,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:14,338 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:28:14,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:14,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:14,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:14,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:14,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:28:14,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 06:28:14,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 22 [2022-07-20 06:28:14,616 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-20 06:28:14,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 30 treesize of output 36 [2022-07-20 06:28:14,627 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-07-20 06:28:14,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 43 [2022-07-20 06:28:14,948 INFO L356 Elim1Store]: treesize reduction 106, result has 45.6 percent of original size [2022-07-20 06:28:14,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 10 case distinctions, treesize of input 108 treesize of output 154 [2022-07-20 06:28:15,012 INFO L356 Elim1Store]: treesize reduction 98, result has 49.7 percent of original size [2022-07-20 06:28:15,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 4 new quantified variables, introduced 10 case distinctions, treesize of input 163 treesize of output 237 [2022-07-20 06:28:21,928 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-20 06:28:21,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 38 [2022-07-20 06:28:21,934 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:21,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 20 [2022-07-20 06:28:21,958 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:28:21,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:52,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse5 (select .cse7 4))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse7))) (store .cse6 .cse5 (store (select .cse6 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) 4) 0))))) is different from false [2022-07-20 06:28:54,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse3 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse4 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse7)) (.cse6 (select .cse7 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0))) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) is different from false [2022-07-20 06:28:56,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= 0 (select (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse5 (select .cse7 4))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse7))) (store .cse6 .cse5 (store (select .cse6 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))) 4)))))) is different from false [2022-07-20 06:28:58,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse3 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3))) (store .cse2 .cse1 (store (select .cse2 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse4 (let ((.cse7 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse7)) (.cse6 (select .cse7 4))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) is different from false [2022-07-20 06:29:00,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2498 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4) v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse6 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse8 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse5 (select .cse8 4))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse6 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8))) (store .cse7 .cse5 (store (select .cse7 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) is different from false [2022-07-20 06:29:02,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2498 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4) v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse2 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse4 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_#res#1.base|) 4))))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse5 (let ((.cse8 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse8)) (.cse7 (select .cse8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0))))) is different from false [2022-07-20 06:29:05,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2498 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse2 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse4 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse2 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse5 (let ((.cse8 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8)) (.cse7 (select .cse8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))))) is different from false [2022-07-20 06:29:05,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:05,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:05,097 INFO L356 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-07-20 06:29:05,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 156 [2022-07-20 06:29:05,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:05,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:05,179 INFO L356 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-07-20 06:29:05,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 124 [2022-07-20 06:29:05,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:05,217 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:05,254 INFO L356 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-07-20 06:29:05,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 179 [2022-07-20 06:29:05,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:05,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 21 treesize of output 25 [2022-07-20 06:29:05,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:29:06,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:06,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 18 [2022-07-20 06:29:06,293 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (or (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse2 (select v_arrayElimArr_13 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (let ((.cse3 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (not (= (select v_arrayElimArr_13 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< 0 .cse3))))) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_5 Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (< 0 .cse4) (not (= (select v_arrayElimArr_12 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= (select (let ((.cse6 (select v_arrayElimArr_12 4))) (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_5))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (<= (select v_arrayElimArr_14 .cse8) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2506 Int)) (= (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse11 (select v_arrayElimArr_13 4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_5 Int)) (= (select (let ((.cse13 (select v_arrayElimArr_12 4))) (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse12 .cse13 (store (select .cse12 .cse13) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse14 .cse13 (store (select .cse14 .cse13) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_5))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) (< 0 .cse8)))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) is different from false [2022-07-20 06:29:06,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:29:06,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:06,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 18 [2022-07-20 06:29:06,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-20 06:29:06,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:06,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 18 [2022-07-20 06:29:07,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-20 06:29:07,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-20 06:29:07,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-20 06:29:07,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 8 [2022-07-20 06:29:07,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:29:07,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:29:07,739 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:07,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 58 [2022-07-20 06:29:07,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:07,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 38 [2022-07-20 06:29:07,750 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:07,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 60 [2022-07-20 06:29:07,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 52 treesize of output 46 [2022-07-20 06:29:07,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:07,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2022-07-20 06:29:07,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:07,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2022-07-20 06:29:07,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:07,790 INFO L356 Elim1Store]: treesize reduction 26, result has 13.3 percent of original size [2022-07-20 06:29:07,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 238 treesize of output 208 [2022-07-20 06:29:07,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:07,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 40 treesize of output 34 [2022-07-20 06:29:07,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:07,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:29:07,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 32 treesize of output 24 [2022-07-20 06:29:07,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 20 [2022-07-20 06:29:07,809 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:29:07,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:29:07,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:29:07,837 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 12 not checked. [2022-07-20 06:29:07,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434604669] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:29:07,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:29:07,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 31] total 72 [2022-07-20 06:29:07,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251786589] [2022-07-20 06:29:07,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:29:07,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-20 06:29:07,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:29:07,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-20 06:29:07,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=3801, Unknown=22, NotChecked=1048, Total=5112 [2022-07-20 06:29:07,839 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand has 72 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:29:08,124 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (let ((.cse9 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (or (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse3 (select v_arrayElimArr_13 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (not (= (select v_arrayElimArr_13 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< 0 .cse4))))) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_5 Int)) (or (let ((.cse5 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (< 0 .cse5) (not (= (select v_arrayElimArr_12 .cse5) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= (select (let ((.cse7 (select v_arrayElimArr_12 4))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse8 .cse7 (store (select .cse8 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_5))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (<= (select v_arrayElimArr_14 .cse9) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2506 Int)) (= (select (let ((.cse10 (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse12 (select v_arrayElimArr_13 4))) (store .cse11 .cse12 (store (select .cse11 .cse12) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_5 Int)) (= (select (let ((.cse14 (select v_arrayElimArr_12 4))) (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse13 .cse14 (store (select .cse13 .cse14) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse15 .cse14 (store (select .cse15 .cse14) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_5))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) (< 0 .cse9)))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0))) is different from false [2022-07-20 06:29:08,133 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (forall ((v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (or (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2506 Int)) (or (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse2 (select v_arrayElimArr_13 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0) (let ((.cse3 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (not (= (select v_arrayElimArr_13 .cse3) |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (< 0 .cse3))))) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_5 Int)) (or (let ((.cse4 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (and (< 0 .cse4) (not (= (select v_arrayElimArr_12 .cse4) |c_ULTIMATE.start_sll_create_~head~0#1.base|)))) (= (select (let ((.cse6 (select v_arrayElimArr_12 4))) (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_5))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)))) (not (<= (select v_arrayElimArr_14 .cse8) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (or (and (forall ((v_arrayElimArr_13 (Array Int Int)) (v_ArrVal_2506 Int)) (= (select (let ((.cse9 (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_13)) (.cse11 (select v_arrayElimArr_13 4))) (store .cse10 .cse11 (store (select .cse10 .cse11) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))))) (select .cse9 (select (select .cse9 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_arrayElimArr_12 (Array Int Int)) (v_prenex_5 Int)) (= (select (let ((.cse13 (select v_arrayElimArr_12 4))) (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_14))) (store .cse12 .cse13 (store (select .cse12 .cse13) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimArr_12))) (store .cse14 .cse13 (store (select .cse14 .cse13) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_prenex_5))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))) (< 0 .cse8)))) (< (select v_arrayElimArr_14 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) is different from false [2022-07-20 06:29:10,137 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| |c_ULTIMATE.start_node_create_~temp~0#1.offset|) (forall ((v_ArrVal_2498 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse2 (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse4 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base|) .cse2 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse5 (let ((.cse8 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base|) (+ 4 |c_ULTIMATE.start_node_create_~temp~0#1.offset|) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| .cse8)) (.cse7 (select .cse8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_~temp~0#1.base|) 4))) 4) 0))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) is different from false [2022-07-20 06:29:12,145 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_node_create_#res#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_node_create_#res#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (forall ((v_ArrVal_2498 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4) v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse2 (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4))) (let ((.cse4 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (select .cse4 4))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_#res#1.base|) .cse2 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse0 .cse1 (store (select .cse0 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse4))) (store .cse3 .cse1 (store (select .cse3 .cse1) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_node_create_#res#1.base|) 4))))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse5 (let ((.cse8 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base|) (+ |c_ULTIMATE.start_node_create_#res#1.offset| 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_#res#1.base| .cse8)) (.cse7 (select .cse8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_node_create_#res#1.base|) 4))) 4) 0))))) (not (= |c_ULTIMATE.start_node_create_#res#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) is different from false [2022-07-20 06:29:14,150 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2498 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (not (<= v_ArrVal_2498 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (< (select (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4) v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse0 (let ((.cse3 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse3)) (.cse2 (select .cse3 4))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse6 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse8 (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse6 |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse5 (select .cse8 4))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse6 v_ArrVal_2498) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse4 .cse5 (store (select .cse4 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8))) (store .cse7 .cse5 (store (select .cse7 .cse5) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0)) is different from false [2022-07-20 06:29:16,155 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4))) (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0))) (and (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse0)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (select .cse4 4))) (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse4))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse5 (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse8)) (.cse7 (select .cse8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4))) 4) 0))) (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|))) (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0)))) is different from false [2022-07-20 06:29:18,159 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse1 (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= 0 (select (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (select .cse8 4))) (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse8))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4)))) 4)))))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-07-20 06:29:20,162 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (and (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (select .cse4 4))) (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse1 .cse2 (store (select .cse1 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse4))) (store .cse3 .cse2 (store (select .cse3 .cse2) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_sll_create_#res#1.base|) 4)))) 4) 0)) (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse5 (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse8)) (.cse7 (select .cse8 4))) (store .cse6 .cse7 (store (select .cse6 .cse7) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) 4) 0))) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|))) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0))) is different from false [2022-07-20 06:29:22,167 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= 0 (select (select |c_#memory_$Pointer$.offset| .cse0) 4)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_48| Int) (v_ArrVal_2502 Int) (|v_ULTIMATE.start_sll_update_at_~head#1.offset_46| Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_48|) (< (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502) 4) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46|) (and (forall ((v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse1 (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4)) (.cse3 (select .cse4 4))) (store .cse2 .cse3 (store (select .cse2 .cse3) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506)))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) 4) 0)) (forall ((v_ArrVal_2507 Int) (v_ArrVal_2503 Int) (v_ArrVal_2506 Int)) (= (select (let ((.cse8 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2503))) (let ((.cse6 (select .cse8 4))) (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_48| v_ArrVal_2502)))) (store .cse5 .cse6 (store (select .cse5 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2507))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse8))) (store .cse7 .cse6 (store (select .cse7 .cse6) |v_ULTIMATE.start_sll_update_at_~head#1.offset_46| v_ArrVal_2506))) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) 4) 0))))))) is different from false [2022-07-20 06:29:22,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:29:22,983 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-20 06:29:22,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 06:29:22,983 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-20 06:29:22,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:29:22,984 INFO L225 Difference]: With dead ends: 142 [2022-07-20 06:29:22,984 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 06:29:22,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 102 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1315 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=385, Invalid=5352, Unknown=31, NotChecked=2788, Total=8556 [2022-07-20 06:29:22,985 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 116 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 662 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:29:22,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1050 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 741 Invalid, 0 Unknown, 662 Unchecked, 0.3s Time] [2022-07-20 06:29:22,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 06:29:22,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2022-07-20 06:29:22,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 134 states have (on average 1.0522388059701493) internal successors, (141), 138 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:29:22,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2022-07-20 06:29:22,988 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 71 [2022-07-20 06:29:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:29:22,988 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2022-07-20 06:29:22,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.3333333333333335) internal successors, (168), 72 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:29:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2022-07-20 06:29:22,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-20 06:29:22,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:29:22,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:29:23,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-20 06:29:23,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-07-20 06:29:23,207 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:29:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:29:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1204491648, now seen corresponding path program 2 times [2022-07-20 06:29:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:29:23,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850256104] [2022-07-20 06:29:23,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:29:23,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:29:23,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:29:24,625 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:29:24,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:29:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850256104] [2022-07-20 06:29:24,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850256104] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:29:24,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794820357] [2022-07-20 06:29:24,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:29:24,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:29:24,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:29:24,633 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:29:24,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-20 06:29:24,885 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:29:24,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:29:24,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-20 06:29:24,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:29:25,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:29:25,534 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-20 06:29:25,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 41 [2022-07-20 06:29:25,920 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:29:25,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 78 [2022-07-20 06:29:25,942 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-07-20 06:29:25,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 64 treesize of output 58 [2022-07-20 06:29:26,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:26,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 65 [2022-07-20 06:29:26,983 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-20 06:29:26,983 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:29:27,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 06:29:27,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 06:29:27,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 06:29:27,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse0) (select .cse0 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)))) is different from false [2022-07-20 06:29:27,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:27,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 45 treesize of output 45 [2022-07-20 06:29:27,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:27,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:29:27,843 INFO L356 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-07-20 06:29:27,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 70 treesize of output 92 [2022-07-20 06:29:27,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:29:27,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 120 [2022-07-20 06:29:27,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-07-20 06:29:44,546 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 38 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:30:01,018 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse0 (= |c_ULTIMATE.start_node_create_~temp~0#1.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|))) (or (and .cse0 (forall ((v_arrayElimCell_190 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base| 0) v_arrayElimCell_190 0) v_antiDerIndex_entry0_1)))) (and (not .cse0) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base| 0) |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_188 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base| 0) v_arrayElimCell_188 0) v_antiDerIndex_entry0_1)) (and (= |c_ULTIMATE.start_node_create_~temp~0#1.base| v_arrayElimCell_188) (forall ((v_arrayElimCell_190 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store |c_#valid| |c_ULTIMATE.start_node_create_~temp~0#1.base| 0) v_arrayElimCell_190 0) v_antiDerIndex_entry0_1)))))) (= |c_ULTIMATE.start_node_create_~temp~0#1.offset| 0))) is different from false [2022-07-20 06:30:09,286 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:30:19,498 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:30:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2022-07-20 06:30:19,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794820357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:30:19,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:30:19,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 26, 26] total 82 [2022-07-20 06:30:19,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811755791] [2022-07-20 06:30:19,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:30:19,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-20 06:30:19,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-20 06:30:19,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=5752, Unknown=27, NotChecked=780, Total=6806 [2022-07-20 06:30:19,872 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand has 83 states, 82 states have (on average 2.3536585365853657) internal successors, (193), 83 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:24,710 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|))) (let ((.cse0 (select .cse3 4))) (and (exists ((v_ArrVal_2619 Int)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 1) |c_ULTIMATE.start_sll_create_~new_head~0#1.base| v_ArrVal_2619))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse0) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse1) (select .cse1 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4) 0)))) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 4)) (let ((.cse2 (select .cse3 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)))) (or (= .cse0 0) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse2) (= (store (store |c_#valid| .cse2 0) |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| .cse0 1) |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 0)))) is different from false [2022-07-20 06:30:24,714 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| .cse0 1) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse0) 0) (or (= .cse0 0) (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|) (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base| 0) (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base| .cse1) (select .cse1 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_sll_create_~head~0#1.offset|) (exists ((v_ArrVal_2619 Int)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 4) 1) |c_ULTIMATE.start_sll_create_~head~0#1.base| v_ArrVal_2619))) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0))) is different from false [2022-07-20 06:30:24,718 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4))) (and (= |c_ULTIMATE.start_sll_create_#res#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (exists ((v_ArrVal_2619 Int)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 1) |c_ULTIMATE.start_sll_create_#res#1.base| v_ArrVal_2619))) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse0) 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base| 0) (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base| .cse1) (select .cse1 4) v_ArrVal_2624)) |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) (or (= 0 .cse0) (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse0) (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_sll_create_#res#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| .cse0 1) |c_ULTIMATE.start_sll_create_#res#1.base|) 0))) is different from false [2022-07-20 06:30:24,723 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| .cse0 1) |c_ULTIMATE.start_main_~s~0#1.base|) 0) (exists ((v_ArrVal_2619 Int)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) 4) 1) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2619))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) 4)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_update_at_~head#1.offset_51| Int) (v_ArrVal_2624 (Array Int Int)) (v_ArrVal_2623 Int)) (or (< 0 |v_ULTIMATE.start_sll_update_at_~head#1.offset_51|) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~s~0#1.base| 0) (select (select (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |v_ULTIMATE.start_sll_update_at_~head#1.offset_51| v_ArrVal_2623))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) (select .cse1 4) v_ArrVal_2624)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) 0) |c_ULTIMATE.start_main_old_#valid#1|))) (or (= |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (= (store (store |c_#valid| .cse0 0) |c_ULTIMATE.start_main_~s~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (= .cse0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse0) 0))) is different from false [2022-07-20 06:30:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:26,215 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2022-07-20 06:30:26,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 06:30:26,216 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 2.3536585365853657) internal successors, (193), 83 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2022-07-20 06:30:26,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:26,216 INFO L225 Difference]: With dead ends: 141 [2022-07-20 06:30:26,216 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:30:26,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 101 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 60.7s TimeCoverageRelationStatistics Valid=507, Invalid=9004, Unknown=31, NotChecked=1800, Total=11342 [2022-07-20 06:30:26,217 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 147 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 450 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:26,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1192 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 407 Invalid, 0 Unknown, 450 Unchecked, 0.2s Time] [2022-07-20 06:30:26,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:30:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-20 06:30:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 89 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2022-07-20 06:30:26,219 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 72 [2022-07-20 06:30:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:26,219 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2022-07-20 06:30:26,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 2.3536585365853657) internal successors, (193), 83 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:26,220 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2022-07-20 06:30:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-20 06:30:26,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:30:26,220 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:26,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:30:26,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-20 06:30:26,438 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-07-20 06:30:26,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:30:26,439 INFO L85 PathProgramCache]: Analyzing trace with hash 82147636, now seen corresponding path program 3 times [2022-07-20 06:30:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:30:26,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608059979] [2022-07-20 06:30:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:30:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:30:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:30:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 06:30:26,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:30:26,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608059979] [2022-07-20 06:30:26,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608059979] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:30:26,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1700757308] [2022-07-20 06:30:26,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 06:30:26,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:26,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:30:26,512 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:30:26,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-20 06:30:26,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 06:30:26,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:30:26,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:30:26,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:30:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-20 06:30:26,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:30:26,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1700757308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:30:26,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:30:26,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-20 06:30:26,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840139419] [2022-07-20 06:30:26,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:30:26,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:30:26,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:30:26,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:30:26,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:30:26,805 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:26,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:30:26,810 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2022-07-20 06:30:26,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:30:26,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2022-07-20 06:30:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:30:26,811 INFO L225 Difference]: With dead ends: 21 [2022-07-20 06:30:26,811 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 06:30:26,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:30:26,811 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:30:26,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:30:26,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 06:30:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 06:30:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 06:30:26,824 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 80 [2022-07-20 06:30:26,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:30:26,824 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 06:30:26,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:30:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 06:30:26,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 06:30:26,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 21 remaining) [2022-07-20 06:30:26,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 21 remaining) [2022-07-20 06:30:26,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 21 remaining) [2022-07-20 06:30:26,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 21 remaining) [2022-07-20 06:30:26,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 21 remaining) [2022-07-20 06:30:26,827 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 21 remaining) [2022-07-20 06:30:26,828 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 21 remaining) [2022-07-20 06:30:26,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 21 remaining) [2022-07-20 06:30:26,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 21 remaining) [2022-07-20 06:30:26,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE (4 of 21 remaining) [2022-07-20 06:30:26,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE (3 of 21 remaining) [2022-07-20 06:30:26,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE (2 of 21 remaining) [2022-07-20 06:30:26,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (1 of 21 remaining) [2022-07-20 06:30:26,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 21 remaining) [2022-07-20 06:30:26,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:30:27,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:30:27,046 INFO L356 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:30:27,049 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 06:30:27,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:30:27 BoogieIcfgContainer [2022-07-20 06:30:27,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 06:30:27,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 06:30:27,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 06:30:27,057 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 06:30:27,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:26:43" (3/4) ... [2022-07-20 06:30:27,059 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 06:30:27,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-20 06:30:27,066 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-07-20 06:30:27,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-20 06:30:27,067 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 06:30:27,102 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 06:30:27,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 06:30:27,103 INFO L158 Benchmark]: Toolchain (without parser) took 224606.55ms. Allocated memory was 123.7MB in the beginning and 339.7MB in the end (delta: 216.0MB). Free memory was 98.3MB in the beginning and 250.6MB in the end (delta: -152.3MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2022-07-20 06:30:27,103 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:30:27,103 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.26ms. Allocated memory is still 123.7MB. Free memory was 98.0MB in the beginning and 89.8MB in the end (delta: 8.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-07-20 06:30:27,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.71ms. Allocated memory is still 123.7MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:30:27,103 INFO L158 Benchmark]: Boogie Preprocessor took 42.99ms. Allocated memory is still 123.7MB. Free memory was 87.7MB in the beginning and 86.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:30:27,103 INFO L158 Benchmark]: RCFGBuilder took 391.73ms. Allocated memory is still 123.7MB. Free memory was 86.0MB in the beginning and 70.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-20 06:30:27,104 INFO L158 Benchmark]: TraceAbstraction took 223675.57ms. Allocated memory was 123.7MB in the beginning and 339.7MB in the end (delta: 216.0MB). Free memory was 70.4MB in the beginning and 254.8MB in the end (delta: -184.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. [2022-07-20 06:30:27,104 INFO L158 Benchmark]: Witness Printer took 45.76ms. Allocated memory is still 339.7MB. Free memory was 254.8MB in the beginning and 250.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 06:30:27,107 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 100.7MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 394.26ms. Allocated memory is still 123.7MB. Free memory was 98.0MB in the beginning and 89.8MB in the end (delta: 8.2MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.71ms. Allocated memory is still 123.7MB. Free memory was 89.8MB in the beginning and 87.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.99ms. Allocated memory is still 123.7MB. Free memory was 87.7MB in the beginning and 86.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.73ms. Allocated memory is still 123.7MB. Free memory was 86.0MB in the beginning and 70.8MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 223675.57ms. Allocated memory was 123.7MB in the beginning and 339.7MB in the end (delta: 216.0MB). Free memory was 70.4MB in the beginning and 254.8MB in the end (delta: -184.4MB). Peak memory consumption was 31.8MB. Max. memory is 16.1GB. * Witness Printer took 45.76ms. Allocated memory is still 339.7MB. Free memory was 254.8MB in the beginning and 250.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 630]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 613]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 21 error locations. Started 1 CEGAR loops. OverallTime: 223.6s, OverallIterations: 36, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 57.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9140 SdHoareTripleChecker+Valid, 5.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9140 mSDsluCounter, 14383 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7014 IncrementalHoareTripleChecker+Unchecked, 12777 mSDsCounter, 813 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13079 IncrementalHoareTripleChecker+Invalid, 20906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 813 mSolverCounterUnsat, 1606 mSDtfsCounter, 13079 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2945 GetRequests, 1624 SyntacticMatches, 64 SemanticMatches, 1257 ConstructedPredicates, 131 IntricatePredicates, 4 DeprecatedPredicates, 14732 ImplicationChecksByTransitivity, 188.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=34, InterpolantAutomatonStates: 569, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 36 MinimizatonAttempts, 838 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 157.1s InterpolantComputationTime, 2639 NumberOfCodeBlocks, 2639 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 3468 ConstructedInterpolants, 401 QuantifiedInterpolants, 58379 SizeOfPredicates, 456 NumberOfNonLiveVariables, 7854 ConjunctsInSsa, 1058 ConjunctsInUnsatCore, 76 InterpolantComputations, 18 PerfectInterpolantSequences, 972/1786 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 21 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-20 06:30:27,317 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-20 06:30:27,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE