./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:48:21,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:48:21,046 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:48:21,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:48:21,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:48:21,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:48:21,068 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:48:21,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:48:21,075 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:48:21,076 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:48:21,077 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:48:21,078 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:48:21,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:48:21,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:48:21,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:48:21,080 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:48:21,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:48:21,097 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:48:21,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:48:21,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:48:21,100 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:48:21,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:48:21,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:48:21,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:48:21,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:48:21,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:48:21,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:48:21,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:48:21,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:48:21,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:48:21,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:48:21,106 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:48:21,106 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:48:21,107 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:48:21,107 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:48:21,108 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:48:21,108 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:48:21,109 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:48:21,109 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:48:21,109 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:48:21,109 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:48:21,111 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:48:21,112 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 17:48:21,132 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:48:21,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:48:21,134 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:48:21,134 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:48:21,135 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:48:21,135 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:48:21,136 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:48:21,136 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:48:21,136 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:48:21,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:48:21,137 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:48:21,137 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:48:21,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:48:21,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:48:21,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:48:21,138 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:48:21,138 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:48:21,138 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:48:21,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:48:21,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:48:21,138 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:48:21,138 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:48:21,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:48:21,139 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:48:21,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:48:21,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:48:21,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:48:21,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:48:21,140 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 17:48:21,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 17:48:21,140 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2022-07-21 17:48:21,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:48:21,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:48:21,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:48:21,465 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:48:21,467 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:48:21,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-21 17:48:21,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cada887/744fe6bbd45e4e6cbe9b9724682ce483/FLAG72c054ef0 [2022-07-21 17:48:21,958 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:48:21,961 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-21 17:48:21,978 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cada887/744fe6bbd45e4e6cbe9b9724682ce483/FLAG72c054ef0 [2022-07-21 17:48:22,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57cada887/744fe6bbd45e4e6cbe9b9724682ce483 [2022-07-21 17:48:22,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:48:22,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:48:22,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:48:22,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:48:22,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:48:22,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61ddeab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22, skipping insertion in model container [2022-07-21 17:48:22,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:48:22,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:48:22,588 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/sll2c_update_all.i[24418,24431] [2022-07-21 17:48:22,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:48:22,602 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:48:22,653 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/sll2c_update_all.i[24418,24431] [2022-07-21 17:48:22,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:48:22,677 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:48:22,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22 WrapperNode [2022-07-21 17:48:22,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:48:22,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:48:22,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:48:22,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:48:22,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,738 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-07-21 17:48:22,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:48:22,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:48:22,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:48:22,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:48:22,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:48:22,790 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:48:22,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:48:22,791 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:48:22,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (1/1) ... [2022-07-21 17:48:22,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:48:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:22,818 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-21 17:48:22,826 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-21 17:48:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 17:48:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 17:48:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 17:48:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 17:48:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:48:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:48:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:48:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:48:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:48:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 17:48:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:48:22,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:48:22,938 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:48:22,952 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:48:23,175 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:48:23,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:48:23,180 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 17:48:23,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:48:23 BoogieIcfgContainer [2022-07-21 17:48:23,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:48:23,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:48:23,183 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:48:23,185 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:48:23,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:48:22" (1/3) ... [2022-07-21 17:48:23,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63cda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:48:23, skipping insertion in model container [2022-07-21 17:48:23,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:22" (2/3) ... [2022-07-21 17:48:23,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f63cda1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:48:23, skipping insertion in model container [2022-07-21 17:48:23,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:48:23" (3/3) ... [2022-07-21 17:48:23,193 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-07-21 17:48:23,204 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:48:23,205 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-21 17:48:23,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:48:23,244 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@b5ee082, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5df86626 [2022-07-21 17:48:23,244 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-21 17:48:23,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:48:23,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:23,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:48:23,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:23,274 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-07-21 17:48:23,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:23,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856361822] [2022-07-21 17:48:23,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:23,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:23,437 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-21 17:48:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:23,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856361822] [2022-07-21 17:48:23,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856361822] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:23,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:23,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:48:23,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517443744] [2022-07-21 17:48:23,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:23,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:48:23,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:23,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:48:23,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:48:23,469 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:23,569 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-21 17:48:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:48:23,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 17:48:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:23,577 INFO L225 Difference]: With dead ends: 81 [2022-07-21 17:48:23,579 INFO L226 Difference]: Without dead ends: 78 [2022-07-21 17:48:23,581 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-21 17:48:23,584 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:23,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-21 17:48:23,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-21 17:48:23,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-21 17:48:23,624 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-07-21 17:48:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:23,625 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-21 17:48:23,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-21 17:48:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:48:23,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:23,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:48:23,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 17:48:23,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:23,628 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-07-21 17:48:23,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:23,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382487825] [2022-07-21 17:48:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:23,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:23,705 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-21 17:48:23,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:23,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382487825] [2022-07-21 17:48:23,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382487825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:23,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:23,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:48:23,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204292183] [2022-07-21 17:48:23,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:23,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:48:23,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:48:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:48:23,714 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:23,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:23,763 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-21 17:48:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:48:23,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 17:48:23,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:23,765 INFO L225 Difference]: With dead ends: 76 [2022-07-21 17:48:23,765 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 17:48:23,765 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-21 17:48:23,766 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:23,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:23,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 17:48:23,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-21 17:48:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-21 17:48:23,787 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-07-21 17:48:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:23,789 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-21 17:48:23,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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:23,790 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-21 17:48:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:48:23,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:23,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:23,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 17:48:23,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:23,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:23,792 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-07-21 17:48:23,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:23,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717673065] [2022-07-21 17:48:23,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:23,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:23,871 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-21 17:48:23,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:23,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717673065] [2022-07-21 17:48:23,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717673065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:23,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:23,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:48:23,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568337381] [2022-07-21 17:48:23,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:23,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:48:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:23,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:48:23,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:48:23,874 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:48:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:23,926 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-21 17:48:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:48:23,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-21 17:48:23,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:23,927 INFO L225 Difference]: With dead ends: 83 [2022-07-21 17:48:23,928 INFO L226 Difference]: Without dead ends: 83 [2022-07-21 17:48:23,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:48:23,929 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:23,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:23,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-21 17:48:23,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-21 17:48:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-21 17:48:23,948 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-07-21 17:48:23,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:23,949 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-21 17:48:23,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:48:23,949 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-21 17:48:23,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:48:23,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:23,950 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:23,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 17:48:23,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:23,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-07-21 17:48:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:23,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879582163] [2022-07-21 17:48:23,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:23,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,062 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:48:24,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:24,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879582163] [2022-07-21 17:48:24,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879582163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:24,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:24,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:48:24,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511968701] [2022-07-21 17:48:24,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:48:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:24,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:48:24,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:48:24,065 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:24,164 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-07-21 17:48:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:48:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-21 17:48:24,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:24,166 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:48:24,166 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 17:48:24,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:48:24,167 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:24,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 17:48:24,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-21 17:48:24,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:24,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-21 17:48:24,176 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-07-21 17:48:24,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:24,176 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-21 17:48:24,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-21 17:48:24,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:48:24,177 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:24,177 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:24,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 17:48:24,177 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:24,178 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-07-21 17:48:24,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:24,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785148316] [2022-07-21 17:48:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:24,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:24,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785148316] [2022-07-21 17:48:24,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785148316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:24,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:24,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 17:48:24,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997592137] [2022-07-21 17:48:24,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:24,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:48:24,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:24,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:48:24,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:48:24,295 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:24,404 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-07-21 17:48:24,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:48:24,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-21 17:48:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:24,409 INFO L225 Difference]: With dead ends: 76 [2022-07-21 17:48:24,409 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 17:48:24,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:48:24,418 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:24,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:24,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 17:48:24,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-07-21 17:48:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-07-21 17:48:24,424 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-07-21 17:48:24,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:24,425 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-07-21 17:48:24,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-07-21 17:48:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:48:24,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:24,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:24,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 17:48:24,426 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:24,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:24,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-07-21 17:48:24,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:24,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201258874] [2022-07-21 17:48:24,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:24,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:48:24,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:24,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201258874] [2022-07-21 17:48:24,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201258874] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:24,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655966202] [2022-07-21 17:48:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:24,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:24,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:24,578 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-21 17:48:24,579 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-21 17:48:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:24,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-21 17:48:24,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:24,688 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-21 17:48:24,800 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-21 17:48:24,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-21 17:48:24,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:24,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:24,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655966202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:24,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:24,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-21 17:48:24,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126787972] [2022-07-21 17:48:24,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:24,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:48:24,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:24,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:48:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:48:24,867 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:48:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:24,965 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-21 17:48:24,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:48:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-21 17:48:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:24,967 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:48:24,967 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:48:24,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-21 17:48:24,970 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:24,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-21 17:48:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:48:24,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-07-21 17:48:24,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-07-21 17:48:24,990 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-07-21 17:48:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:24,990 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-07-21 17:48:24,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:48:24,990 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-07-21 17:48:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:48:24,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:24,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:25,012 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-21 17:48:25,199 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-21 17:48:25,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-07-21 17:48:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:25,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121632229] [2022-07-21 17:48:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:25,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:25,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:25,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121632229] [2022-07-21 17:48:25,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121632229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:25,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767738524] [2022-07-21 17:48:25,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:25,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:25,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:25,395 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-21 17:48:25,396 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-21 17:48:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:25,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 17:48:25,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:25,477 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-21 17:48:25,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:25,690 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 14 treesize of output 16 [2022-07-21 17:48:25,697 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:25,698 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-21 17:48:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:48:25,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:25,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767738524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:25,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:25,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-21 17:48:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966446996] [2022-07-21 17:48:25,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:25,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:48:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:48:25,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-21 17:48:25,832 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:48:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:26,039 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-21 17:48:26,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:48:26,040 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-21 17:48:26,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:26,041 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:48:26,041 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:48:26,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-07-21 17:48:26,042 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 176 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:26,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-07-21 17:48:26,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:48:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-07-21 17:48:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-07-21 17:48:26,045 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-07-21 17:48:26,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:26,045 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-07-21 17:48:26,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-21 17:48:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-07-21 17:48:26,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:48:26,046 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:26,046 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:26,067 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-21 17:48:26,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-21 17:48:26,265 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-07-21 17:48:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:26,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585315912] [2022-07-21 17:48:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:26,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,361 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:48:26,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:26,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585315912] [2022-07-21 17:48:26,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585315912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:26,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:26,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:48:26,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012293401] [2022-07-21 17:48:26,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:26,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:48:26,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:48:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:48:26,363 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:26,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:26,580 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-21 17:48:26,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:48:26,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-21 17:48:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:26,582 INFO L225 Difference]: With dead ends: 142 [2022-07-21 17:48:26,582 INFO L226 Difference]: Without dead ends: 142 [2022-07-21 17:48:26,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:48:26,582 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:26,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:48:26,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-21 17:48:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-07-21 17:48:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:26,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-21 17:48:26,585 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-07-21 17:48:26,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:26,586 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-21 17:48:26,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:26,586 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-21 17:48:26,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:48:26,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:26,586 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:26,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 17:48:26,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:26,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:26,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-07-21 17:48:26,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789506394] [2022-07-21 17:48:26,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:26,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:26,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:26,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789506394] [2022-07-21 17:48:26,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789506394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:26,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:26,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:48:26,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955139904] [2022-07-21 17:48:26,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:26,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:48:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:48:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:48:26,708 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:26,910 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-07-21 17:48:26,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:48:26,911 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-21 17:48:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:26,912 INFO L225 Difference]: With dead ends: 123 [2022-07-21 17:48:26,912 INFO L226 Difference]: Without dead ends: 123 [2022-07-21 17:48:26,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:48:26,912 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 323 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:26,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 485 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-21 17:48:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2022-07-21 17:48:26,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:26,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-07-21 17:48:26,915 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2022-07-21 17:48:26,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:26,915 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-07-21 17:48:26,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-07-21 17:48:26,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:48:26,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:26,916 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:26,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 17:48:26,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:26,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2022-07-21 17:48:26,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:26,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221554594] [2022-07-21 17:48:26,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:26,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:26,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:26,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:26,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221554594] [2022-07-21 17:48:26,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221554594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:26,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:26,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:48:26,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596194777] [2022-07-21 17:48:26,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:26,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:48:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:26,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:48:26,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:48:26,957 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:27,019 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-07-21 17:48:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:48:27,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-07-21 17:48:27,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:27,020 INFO L225 Difference]: With dead ends: 155 [2022-07-21 17:48:27,020 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 17:48:27,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:48:27,021 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 87 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:27,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 297 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 17:48:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 78. [2022-07-21 17:48:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.509090909090909) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-07-21 17:48:27,023 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 32 [2022-07-21 17:48:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:27,024 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-07-21 17:48:27,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-07-21 17:48:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:48:27,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:27,025 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:27,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 17:48:27,025 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:27,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333233, now seen corresponding path program 1 times [2022-07-21 17:48:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:27,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443245688] [2022-07-21 17:48:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:27,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:48:27,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:27,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443245688] [2022-07-21 17:48:27,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443245688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:27,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:27,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:48:27,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492890442] [2022-07-21 17:48:27,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:27,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 17:48:27,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:27,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 17:48:27,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:48:27,102 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:27,291 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-21 17:48:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 17:48:27,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-07-21 17:48:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:27,292 INFO L225 Difference]: With dead ends: 130 [2022-07-21 17:48:27,293 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 17:48:27,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-21 17:48:27,293 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 296 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:27,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 412 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:27,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 17:48:27,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2022-07-21 17:48:27,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.5344827586206897) internal successors, (89), 77 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-07-21 17:48:27,295 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 32 [2022-07-21 17:48:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:27,296 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-07-21 17:48:27,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-07-21 17:48:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:48:27,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:27,296 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:27,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 17:48:27,296 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333232, now seen corresponding path program 1 times [2022-07-21 17:48:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:27,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262053606] [2022-07-21 17:48:27,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,368 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:48:27,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:27,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262053606] [2022-07-21 17:48:27,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262053606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:27,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116212016] [2022-07-21 17:48:27,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:27,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:27,370 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-21 17:48:27,371 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-21 17:48:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:48:27,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:27,483 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:27,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116212016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:27,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 17:48:27,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-21 17:48:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443308693] [2022-07-21 17:48:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:27,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:48:27,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:27,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:48:27,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:48:27,485 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:27,498 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-07-21 17:48:27,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:48:27,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-07-21 17:48:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:27,499 INFO L225 Difference]: With dead ends: 103 [2022-07-21 17:48:27,499 INFO L226 Difference]: Without dead ends: 103 [2022-07-21 17:48:27,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:48:27,500 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 99 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:27,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 141 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-21 17:48:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-07-21 17:48:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.5084745762711864) internal successors, (89), 78 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-07-21 17:48:27,502 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 32 [2022-07-21 17:48:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:27,502 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-07-21 17:48:27,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,503 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-07-21 17:48:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:48:27,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:27,503 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:27,523 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-21 17:48:27,719 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-21 17:48:27,719 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:27,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-07-21 17:48:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:27,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992791866] [2022-07-21 17:48:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:27,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:27,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992791866] [2022-07-21 17:48:27,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992791866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:27,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:27,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:48:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139629628] [2022-07-21 17:48:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:27,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 17:48:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:27,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 17:48:27,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 17:48:27,761 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:27,820 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-21 17:48:27,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:48:27,821 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-07-21 17:48:27,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:27,822 INFO L225 Difference]: With dead ends: 150 [2022-07-21 17:48:27,822 INFO L226 Difference]: Without dead ends: 150 [2022-07-21 17:48:27,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:48:27,823 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 80 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:27,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 258 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:27,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-21 17:48:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2022-07-21 17:48:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.5) internal successors, (90), 79 states have internal predecessors, (90), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-07-21 17:48:27,826 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 33 [2022-07-21 17:48:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:27,826 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-07-21 17:48:27,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-07-21 17:48:27,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:48:27,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:27,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:27,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 17:48:27,828 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:27,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 274321452, now seen corresponding path program 1 times [2022-07-21 17:48:27,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:27,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821467346] [2022-07-21 17:48:27,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:27,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:27,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:27,898 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:48:27,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:27,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821467346] [2022-07-21 17:48:27,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821467346] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:27,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415217618] [2022-07-21 17:48:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:27,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:27,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:27,908 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-21 17:48:27,909 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-21 17:48:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:28,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:48:28,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:28,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:28,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:28,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415217618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:48:28,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:48:28,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-21 17:48:28,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354133958] [2022-07-21 17:48:28,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:28,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:48:28,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:28,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:48:28,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:48:28,091 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:48:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:28,161 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2022-07-21 17:48:28,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:48:28,161 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-21 17:48:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:28,162 INFO L225 Difference]: With dead ends: 130 [2022-07-21 17:48:28,162 INFO L226 Difference]: Without dead ends: 130 [2022-07-21 17:48:28,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:48:28,162 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 145 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:28,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 355 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-21 17:48:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2022-07-21 17:48:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.457142857142857) internal successors, (102), 89 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-07-21 17:48:28,166 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 37 [2022-07-21 17:48:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:28,167 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-07-21 17:48:28,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:48:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-07-21 17:48:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:48:28,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:28,168 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:48:28,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-21 17:48:28,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:28,385 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:28,386 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2022-07-21 17:48:28,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:28,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950175650] [2022-07-21 17:48:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:28,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:28,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:28,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:28,692 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:28,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950175650] [2022-07-21 17:48:28,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950175650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:28,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709213400] [2022-07-21 17:48:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:28,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:28,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:28,695 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-21 17:48:28,696 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-21 17:48:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:28,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-21 17:48:28,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:28,820 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-21 17:48:28,879 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:28,880 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-21 17:48:28,892 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 11 treesize of output 7 [2022-07-21 17:48:28,931 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:28,932 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-21 17:48:29,070 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:48:29,071 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 31 treesize of output 32 [2022-07-21 17:48:29,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:48:29,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:48:29,250 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 16 [2022-07-21 17:48:29,256 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:48:29,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:33,571 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-07-21 17:48:33,572 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 24 treesize of output 23 [2022-07-21 17:48:33,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1039 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| 4) v_ArrVal_1039) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (<= 0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)))) is different from false [2022-07-21 17:48:33,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| Int) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1039 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (not (<= 0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_11| 4) v_ArrVal_1039) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|))) is different from false [2022-07-21 17:48:33,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:48:33,612 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 23 treesize of output 24 [2022-07-21 17:48:33,616 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 36 [2022-07-21 17:48:33,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:48:33,621 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-21 17:48:33,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:48:33,627 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:48:33,627 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 17 treesize of output 21 [2022-07-21 17:48:33,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709213400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:33,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:33,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2022-07-21 17:48:33,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548066328] [2022-07-21 17:48:33,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:33,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 17:48:33,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:48:33,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 17:48:33,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1305, Unknown=6, NotChecked=146, Total=1560 [2022-07-21 17:48:33,790 INFO L87 Difference]: Start difference. First operand 93 states and 106 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:34,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:34,614 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2022-07-21 17:48:34,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 17:48:34,614 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-07-21 17:48:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:34,615 INFO L225 Difference]: With dead ends: 173 [2022-07-21 17:48:34,615 INFO L226 Difference]: Without dead ends: 173 [2022-07-21 17:48:34,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=212, Invalid=2046, Unknown=6, NotChecked=186, Total=2450 [2022-07-21 17:48:34,616 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 102 mSDsluCounter, 1976 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:34,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 2079 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1093 Invalid, 0 Unknown, 129 Unchecked, 0.4s Time] [2022-07-21 17:48:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-21 17:48:34,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 113. [2022-07-21 17:48:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 108 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 132 transitions. [2022-07-21 17:48:34,619 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 132 transitions. Word has length 38 [2022-07-21 17:48:34,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:34,619 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 132 transitions. [2022-07-21 17:48:34,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 25 states have internal predecessors, (51), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:34,620 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-07-21 17:48:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:48:34,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:34,620 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:48:34,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-21 17:48:34,831 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,SelfDestructingSolverStorable14 [2022-07-21 17:48:34,832 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:34,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:34,832 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2022-07-21 17:48:34,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:48:34,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927497633] [2022-07-21 17:48:34,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:34,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:48:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:35,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 17:48:35,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:35,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 17:48:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:35,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:48:35,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927497633] [2022-07-21 17:48:35,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927497633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:35,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42997442] [2022-07-21 17:48:35,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:35,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:48:35,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:35,238 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-21 17:48:35,239 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-21 17:48:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:35,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-21 17:48:35,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:35,383 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-21 17:48:35,639 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:35,639 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-21 17:48:35,659 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 17:48:35,693 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-21 17:48:35,860 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,SelfDestructingSolverStorable15 [2022-07-21 17:48:35,860 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 121733 column 46: unknown constant v_#length_BEFORE_CALL_4 at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.assertTerm(Scriptor.java:147) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.checkOrAddAxiom(DiffWrapperScript.java:161) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript$DiffTransformer.convertApplicationTerm(DiffWrapperScript.java:171) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:352) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.assertTerm(DiffWrapperScript.java:109) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.assertTerm(WrapperScript.java:158) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.assertTerm(ManagedScript.java:134) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:824) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:768) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:582) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-21 17:48:35,862 INFO L158 Benchmark]: Toolchain (without parser) took 13539.18ms. Allocated memory was 50.3MB in the beginning and 117.4MB in the end (delta: 67.1MB). Free memory was 25.4MB in the beginning and 57.3MB in the end (delta: -31.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-07-21 17:48:35,862 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 59.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 17:48:35,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.83ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.2MB in the beginning and 40.9MB in the end (delta: -15.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-21 17:48:35,863 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.34ms. Allocated memory is still 65.0MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:48:35,863 INFO L158 Benchmark]: Boogie Preprocessor took 49.80ms. Allocated memory is still 65.0MB. Free memory was 38.6MB in the beginning and 36.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 17:48:35,863 INFO L158 Benchmark]: RCFGBuilder took 391.90ms. Allocated memory is still 65.0MB. Free memory was 36.9MB in the beginning and 35.4MB in the end (delta: 1.4MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-07-21 17:48:35,863 INFO L158 Benchmark]: TraceAbstraction took 12678.63ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 35.0MB in the beginning and 57.3MB in the end (delta: -22.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2022-07-21 17:48:35,864 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.21ms. Allocated memory is still 50.3MB. Free memory was 32.0MB in the beginning and 32.0MB in the end (delta: 59.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.83ms. Allocated memory was 50.3MB in the beginning and 65.0MB in the end (delta: 14.7MB). Free memory was 25.2MB in the beginning and 40.9MB in the end (delta: -15.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.34ms. Allocated memory is still 65.0MB. Free memory was 40.7MB in the beginning and 38.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.80ms. Allocated memory is still 65.0MB. Free memory was 38.6MB in the beginning and 36.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.90ms. Allocated memory is still 65.0MB. Free memory was 36.9MB in the beginning and 35.4MB in the end (delta: 1.4MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * TraceAbstraction took 12678.63ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 35.0MB in the beginning and 57.3MB in the end (delta: -22.3MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 121733 column 46: unknown constant v_#length_BEFORE_CALL_4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 121733 column 46: unknown constant v_#length_BEFORE_CALL_4: de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1458) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-21 17:48:35,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 1 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 17:48:37,530 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 17:48:37,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 17:48:37,564 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 17:48:37,564 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 17:48:37,565 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 17:48:37,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 17:48:37,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 17:48:37,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 17:48:37,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 17:48:37,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 17:48:37,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 17:48:37,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 17:48:37,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 17:48:37,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 17:48:37,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 17:48:37,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 17:48:37,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 17:48:37,589 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 17:48:37,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 17:48:37,595 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 17:48:37,596 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 17:48:37,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 17:48:37,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 17:48:37,598 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 17:48:37,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 17:48:37,605 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 17:48:37,606 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 17:48:37,607 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 17:48:37,607 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 17:48:37,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 17:48:37,608 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 17:48:37,609 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 17:48:37,610 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 17:48:37,611 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 17:48:37,612 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 17:48:37,612 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 17:48:37,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 17:48:37,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 17:48:37,613 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 17:48:37,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 17:48:37,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 17:48:37,618 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-21 17:48:37,640 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 17:48:37,641 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 17:48:37,641 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 17:48:37,641 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 17:48:37,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 17:48:37,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 17:48:37,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 17:48:37,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 17:48:37,643 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 17:48:37,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 17:48:37,644 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 17:48:37,644 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 17:48:37,644 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 17:48:37,644 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 17:48:37,644 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 17:48:37,644 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 17:48:37,645 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 17:48:37,645 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 17:48:37,645 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 17:48:37,645 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 17:48:37,645 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 17:48:37,645 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 17:48:37,646 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 17:48:37,646 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 17:48:37,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 17:48:37,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 17:48:37,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 17:48:37,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:48:37,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 17:48:37,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 17:48:37,647 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 17:48:37,647 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 17:48:37,647 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 17:48:37,648 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> e86102617f1813255879beda7bab492587801800e6506c4c5cd56fb9179f8713 [2022-07-21 17:48:37,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 17:48:37,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 17:48:37,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 17:48:37,931 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 17:48:37,933 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 17:48:37,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-21 17:48:37,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e6bd112/12e5da86a111418398359bcb085c446a/FLAGafc973715 [2022-07-21 17:48:38,371 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 17:48:38,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-21 17:48:38,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e6bd112/12e5da86a111418398359bcb085c446a/FLAGafc973715 [2022-07-21 17:48:38,721 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/84e6bd112/12e5da86a111418398359bcb085c446a [2022-07-21 17:48:38,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 17:48:38,725 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 17:48:38,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 17:48:38,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 17:48:38,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 17:48:38,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:48:38" (1/1) ... [2022-07-21 17:48:38,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4045e695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:38, skipping insertion in model container [2022-07-21 17:48:38,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 05:48:38" (1/1) ... [2022-07-21 17:48:38,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 17:48:38,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 17:48:39,024 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/sll2c_update_all.i[24418,24431] [2022-07-21 17:48:39,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:48:39,034 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 17:48:39,073 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/sll2c_update_all.i[24418,24431] [2022-07-21 17:48:39,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 17:48:39,100 INFO L208 MainTranslator]: Completed translation [2022-07-21 17:48:39,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39 WrapperNode [2022-07-21 17:48:39,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 17:48:39,102 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 17:48:39,102 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 17:48:39,102 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 17:48:39,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,166 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-07-21 17:48:39,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 17:48:39,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 17:48:39,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 17:48:39,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 17:48:39,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,217 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 17:48:39,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 17:48:39,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 17:48:39,223 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 17:48:39,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (1/1) ... [2022-07-21 17:48:39,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 17:48:39,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:48:39,247 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-21 17:48:39,282 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-21 17:48:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-21 17:48:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-21 17:48:39,309 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-21 17:48:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 17:48:39,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 17:48:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 17:48:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 17:48:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 17:48:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-21 17:48:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 17:48:39,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 17:48:39,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 17:48:39,405 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 17:48:39,406 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 17:48:39,708 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 17:48:39,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 17:48:39,718 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 17:48:39,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:48:39 BoogieIcfgContainer [2022-07-21 17:48:39,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 17:48:39,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 17:48:39,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 17:48:39,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 17:48:39,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 05:48:38" (1/3) ... [2022-07-21 17:48:39,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58105011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:48:39, skipping insertion in model container [2022-07-21 17:48:39,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 05:48:39" (2/3) ... [2022-07-21 17:48:39,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58105011 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 05:48:39, skipping insertion in model container [2022-07-21 17:48:39,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 05:48:39" (3/3) ... [2022-07-21 17:48:39,726 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-07-21 17:48:39,736 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 17:48:39,736 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-21 17:48:39,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 17:48:39,784 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@243e0d3c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34c0a178 [2022-07-21 17:48:39,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-21 17:48:39,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:48:39,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:39,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:48:39,798 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-07-21 17:48:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355823932] [2022-07-21 17:48:39,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:39,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:39,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:39,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:39,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 17:48:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:48:39,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:39,940 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-21 17:48:39,950 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-21 17:48:39,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:39,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:39,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355823932] [2022-07-21 17:48:39,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355823932] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:39,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:39,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:48:39,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553641751] [2022-07-21 17:48:39,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:39,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:48:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:39,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:48:39,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:48:39,983 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:40,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:40,102 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-21 17:48:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:48:40,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 17:48:40,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:40,110 INFO L225 Difference]: With dead ends: 81 [2022-07-21 17:48:40,111 INFO L226 Difference]: Without dead ends: 78 [2022-07-21 17:48:40,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-21 17:48:40,115 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:40,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:40,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-21 17:48:40,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-21 17:48:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:40,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-21 17:48:40,149 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-07-21 17:48:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:40,150 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-21 17:48:40,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:40,150 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-21 17:48:40,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-21 17:48:40,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:40,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-21 17:48:40,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:40,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:40,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:40,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:40,360 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-07-21 17:48:40,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:40,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086464936] [2022-07-21 17:48:40,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:40,361 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:40,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:40,363 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:40,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 17:48:40,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:40,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:48:40,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:40,436 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-21 17:48:40,454 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-21 17:48:40,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:40,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:40,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086464936] [2022-07-21 17:48:40,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086464936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:40,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:40,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 17:48:40,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813692953] [2022-07-21 17:48:40,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:40,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:48:40,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:48:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:48:40,461 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:40,541 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-21 17:48:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:48:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-21 17:48:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:40,543 INFO L225 Difference]: With dead ends: 76 [2022-07-21 17:48:40,543 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 17:48:40,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-21 17:48:40,544 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:40,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:48:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 17:48:40,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-21 17:48:40,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:40,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-21 17:48:40,550 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-07-21 17:48:40,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:40,550 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-21 17:48:40,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:48:40,550 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-21 17:48:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-21 17:48:40,551 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:40,551 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:40,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:40,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:40,757 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:40,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:40,758 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-07-21 17:48:40,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:40,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275591390] [2022-07-21 17:48:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:40,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:40,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:40,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:40,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 17:48:40,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:40,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:48:40,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:40,827 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-21 17:48:40,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:40,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:40,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275591390] [2022-07-21 17:48:40,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275591390] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:40,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:40,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 17:48:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144526555] [2022-07-21 17:48:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:40,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 17:48:40,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 17:48:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 17:48:40,830 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:48:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:40,839 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-21 17:48:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 17:48:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-21 17:48:40,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:40,840 INFO L225 Difference]: With dead ends: 83 [2022-07-21 17:48:40,840 INFO L226 Difference]: Without dead ends: 83 [2022-07-21 17:48:40,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-21 17:48:40,841 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 159 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-21 17:48:40,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 159 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-21 17:48:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-21 17:48:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-21 17:48:40,848 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-07-21 17:48:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:40,848 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-21 17:48:40,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-21 17:48:40,849 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-21 17:48:40,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:48:40,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:40,849 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:40,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:41,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:41,057 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:41,057 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-07-21 17:48:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:41,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905445137] [2022-07-21 17:48:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:41,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:41,059 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:41,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 17:48:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:41,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:48:41,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:41,170 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-21 17:48:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:41,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:41,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:41,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905445137] [2022-07-21 17:48:41,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905445137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:41,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:41,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:48:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991595543] [2022-07-21 17:48:41,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:41,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:48:41,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:48:41,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:48:41,215 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:41,410 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-07-21 17:48:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:48:41,411 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-21 17:48:41,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:41,412 INFO L225 Difference]: With dead ends: 97 [2022-07-21 17:48:41,413 INFO L226 Difference]: Without dead ends: 97 [2022-07-21 17:48:41,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:48:41,413 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 68 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:41,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 227 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:48:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-21 17:48:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-21 17:48:41,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-21 17:48:41,422 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-07-21 17:48:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:41,422 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-21 17:48:41,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:41,423 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-21 17:48:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 17:48:41,423 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:41,424 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:41,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:41,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:41,631 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:41,631 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-07-21 17:48:41,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:41,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205756439] [2022-07-21 17:48:41,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:41,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:41,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:41,633 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:41,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-21 17:48:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:41,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:48:41,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:41,752 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-21 17:48:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:41,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:41,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:41,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205756439] [2022-07-21 17:48:41,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205756439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:41,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:41,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 17:48:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384715287] [2022-07-21 17:48:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:41,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:48:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:48:41,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:48:41,825 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:42,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:42,006 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-07-21 17:48:42,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:48:42,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-21 17:48:42,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:42,007 INFO L225 Difference]: With dead ends: 76 [2022-07-21 17:48:42,007 INFO L226 Difference]: Without dead ends: 76 [2022-07-21 17:48:42,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-21 17:48:42,008 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 69 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:42,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 236 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:48:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-21 17:48:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-07-21 17:48:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-07-21 17:48:42,013 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-07-21 17:48:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:42,013 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-07-21 17:48:42,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-07-21 17:48:42,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:48:42,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:42,014 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:42,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:42,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:42,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:42,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-07-21 17:48:42,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:42,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872926105] [2022-07-21 17:48:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:42,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:42,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:42,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:42,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-21 17:48:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:42,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:48:42,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:42,334 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-21 17:48:42,495 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:48:42,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:48:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:42,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:42,675 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:42,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:42,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872926105] [2022-07-21 17:48:42,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872926105] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:48:42,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:42,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-21 17:48:42,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918623866] [2022-07-21 17:48:42,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:42,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:48:42,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:42,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:48:42,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:48:42,678 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:48:42,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:42,847 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-07-21 17:48:42,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:48:42,847 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-21 17:48:42,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:42,848 INFO L225 Difference]: With dead ends: 101 [2022-07-21 17:48:42,848 INFO L226 Difference]: Without dead ends: 101 [2022-07-21 17:48:42,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:48:42,849 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 62 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:42,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 314 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 36 Unchecked, 0.1s Time] [2022-07-21 17:48:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-21 17:48:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2022-07-21 17:48:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-07-21 17:48:42,853 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2022-07-21 17:48:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:42,854 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-07-21 17:48:42,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:48:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-07-21 17:48:42,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-21 17:48:42,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:42,855 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:42,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:43,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:43,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-07-21 17:48:43,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:43,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534986746] [2022-07-21 17:48:43,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:43,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:43,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:43,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:43,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-21 17:48:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:43,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:48:43,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:43,161 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-21 17:48:43,165 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-21 17:48:43,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:43,329 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-21 17:48:43,335 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:43,335 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-21 17:48:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:48:43,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:45,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:45,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534986746] [2022-07-21 17:48:45,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534986746] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:45,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [133026548] [2022-07-21 17:48:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:45,582 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:48:45,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:48:45,583 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:48:45,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-21 17:48:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:45,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:48:45,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:45,777 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-21 17:48:45,783 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-21 17:48:45,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:45,898 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-21 17:48:45,905 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:45,906 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-21 17:48:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:48:45,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:48,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [133026548] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:48,096 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:48,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-21 17:48:48,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554988589] [2022-07-21 17:48:48,096 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:48,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:48:48,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:48,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:48:48,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2022-07-21 17:48:48,097 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:48,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:48,440 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2022-07-21 17:48:48,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:48:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-21 17:48:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:48,441 INFO L225 Difference]: With dead ends: 163 [2022-07-21 17:48:48,441 INFO L226 Difference]: Without dead ends: 163 [2022-07-21 17:48:48,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=31, Invalid=124, Unknown=1, NotChecked=0, Total=156 [2022-07-21 17:48:48,442 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:48,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 331 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2022-07-21 17:48:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-21 17:48:48,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 87. [2022-07-21 17:48:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.459016393442623) internal successors, (89), 81 states have internal predecessors, (89), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:48,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-21 17:48:48,447 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 25 [2022-07-21 17:48:48,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:48,447 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-21 17:48:48,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-21 17:48:48,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:48:48,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:48,448 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:48,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:48,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:48,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:48,851 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:48,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:48,851 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-07-21 17:48:48,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:48,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777116748] [2022-07-21 17:48:48,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:48,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:48,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:48,853 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:48,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-21 17:48:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:48,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:48:48,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:48,950 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-21 17:48:49,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:49,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:49,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:49,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777116748] [2022-07-21 17:48:49,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777116748] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:49,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:49,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:48:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607254205] [2022-07-21 17:48:49,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:49,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:48:49,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:48:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:48:49,027 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:49,520 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2022-07-21 17:48:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:48:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-21 17:48:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:49,522 INFO L225 Difference]: With dead ends: 155 [2022-07-21 17:48:49,522 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 17:48:49,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:48:49,523 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 313 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:49,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 423 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:48:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 17:48:49,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 90. [2022-07-21 17:48:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.484375) internal successors, (95), 84 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:49,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-07-21 17:48:49,528 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 30 [2022-07-21 17:48:49,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:49,529 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-07-21 17:48:49,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:49,529 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-07-21 17:48:49,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-21 17:48:49,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:49,530 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:49,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-21 17:48:49,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:49,737 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:49,737 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-07-21 17:48:49,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:49,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572886978] [2022-07-21 17:48:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:49,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:49,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:49,739 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:49,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-21 17:48:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:49,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:48:49,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:49,836 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-21 17:48:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:49,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:49,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:49,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572886978] [2022-07-21 17:48:49,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572886978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:49,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:49,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:48:49,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200944782] [2022-07-21 17:48:49,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:49,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:48:49,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:49,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:48:49,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:48:49,987 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:50,497 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-07-21 17:48:50,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:48:50,501 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-21 17:48:50,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:50,502 INFO L225 Difference]: With dead ends: 136 [2022-07-21 17:48:50,502 INFO L226 Difference]: Without dead ends: 136 [2022-07-21 17:48:50,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:48:50,502 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 325 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:50,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 422 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:48:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-21 17:48:50,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2022-07-21 17:48:50,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.453125) internal successors, (93), 84 states have internal predecessors, (93), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:50,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-21 17:48:50,506 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 30 [2022-07-21 17:48:50,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:50,507 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-21 17:48:50,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:50,507 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-21 17:48:50,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 17:48:50,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:50,508 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:50,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:50,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:50,715 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:50,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2022-07-21 17:48:50,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:50,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435905359] [2022-07-21 17:48:50,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:50,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:50,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:50,717 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:50,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-21 17:48:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:50,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-21 17:48:50,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:50,842 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:50,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:50,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:50,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435905359] [2022-07-21 17:48:50,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435905359] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:50,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:50,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:48:50,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779393496] [2022-07-21 17:48:50,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:50,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:48:50,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:50,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:48:50,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:48:50,843 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:50,868 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-07-21 17:48:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:48:50,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-07-21 17:48:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:50,869 INFO L225 Difference]: With dead ends: 119 [2022-07-21 17:48:50,870 INFO L226 Difference]: Without dead ends: 119 [2022-07-21 17:48:50,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:48:50,870 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 112 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:50,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 143 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:50,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-21 17:48:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2022-07-21 17:48:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:50,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-21 17:48:50,874 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2022-07-21 17:48:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:50,874 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-21 17:48:50,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-21 17:48:50,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-21 17:48:50,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:50,875 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:48:50,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:51,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:51,079 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:51,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-07-21 17:48:51,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:51,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981038291] [2022-07-21 17:48:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:51,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:51,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:51,081 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:51,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-21 17:48:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:51,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:48:51,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:51,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:51,189 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:48:51,189 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:51,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981038291] [2022-07-21 17:48:51,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981038291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:48:51,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:48:51,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:48:51,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652214260] [2022-07-21 17:48:51,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:48:51,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:48:51,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:51,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:48:51,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:48:51,192 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:51,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:51,228 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-07-21 17:48:51,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:48:51,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2022-07-21 17:48:51,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:51,230 INFO L225 Difference]: With dead ends: 168 [2022-07-21 17:48:51,230 INFO L226 Difference]: Without dead ends: 168 [2022-07-21 17:48:51,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-21 17:48:51,230 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 98 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 221 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-21 17:48:51,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 221 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-21 17:48:51,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 93. [2022-07-21 17:48:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 87 states have internal predecessors, (96), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:48:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2022-07-21 17:48:51,234 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 33 [2022-07-21 17:48:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:51,234 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2022-07-21 17:48:51,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:48:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-07-21 17:48:51,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:48:51,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:51,235 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:51,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:51,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:51,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2022-07-21 17:48:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:51,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699429695] [2022-07-21 17:48:51,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:48:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:51,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:51,445 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:51,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-21 17:48:51,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:48:51,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:48:51,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:48:51,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-21 17:48:51,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:51,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 17:48:51,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699429695] [2022-07-21 17:48:51,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699429695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:48:51,623 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:51,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-21 17:48:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977304004] [2022-07-21 17:48:51,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:51,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 17:48:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:51,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 17:48:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:48:51,624 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 17:48:51,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:51,637 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-07-21 17:48:51,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 17:48:51,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-07-21 17:48:51,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:51,638 INFO L225 Difference]: With dead ends: 86 [2022-07-21 17:48:51,638 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 17:48:51,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-21 17:48:51,639 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 186 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:51,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 158 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:51,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 17:48:51,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-21 17:48:51,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:51,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-21 17:48:51,641 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 37 [2022-07-21 17:48:51,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:51,641 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-21 17:48:51,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-21 17:48:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-21 17:48:51,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 17:48:51,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:51,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:48:51,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-21 17:48:51,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:51,842 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 274321506, now seen corresponding path program 1 times [2022-07-21 17:48:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:51,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [748266666] [2022-07-21 17:48:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:51,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:51,845 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:51,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-21 17:48:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:51,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:48:51,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:52,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:52,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:48:52,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:52,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [748266666] [2022-07-21 17:48:52,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [748266666] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:48:52,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:48:52,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 17:48:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524749922] [2022-07-21 17:48:52,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:48:52,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:48:52,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:48:52,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:48:52,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:48:52,064 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:48:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:48:52,117 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-21 17:48:52,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:48:52,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-21 17:48:52,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:48:52,118 INFO L225 Difference]: With dead ends: 132 [2022-07-21 17:48:52,118 INFO L226 Difference]: Without dead ends: 132 [2022-07-21 17:48:52,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:48:52,119 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 170 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:48:52,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 268 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:48:52,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-21 17:48:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2022-07-21 17:48:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 94 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:48:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-07-21 17:48:52,121 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 37 [2022-07-21 17:48:52,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:48:52,121 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-07-21 17:48:52,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:48:52,121 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-07-21 17:48:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:48:52,122 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:48:52,122 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:48:52,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-21 17:48:52,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:48:52,329 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:48:52,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:48:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2022-07-21 17:48:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:48:52,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645488351] [2022-07-21 17:48:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:52,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:48:52,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:48:52,331 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:48:52,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-21 17:48:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:52,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-21 17:48:52,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:52,470 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-21 17:48:52,556 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:48:52,556 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-21 17:48:52,605 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 11 treesize of output 7 [2022-07-21 17:48:52,685 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:52,686 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-21 17:48:52,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:52,906 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 31 treesize of output 26 [2022-07-21 17:48:52,976 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 25 treesize of output 13 [2022-07-21 17:48:53,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:53,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:48:56,135 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-21 17:48:56,135 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 19 treesize of output 18 [2022-07-21 17:48:56,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-21 17:48:56,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_510 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_510) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-07-21 17:48:56,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:48:56,167 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 18 treesize of output 19 [2022-07-21 17:48:56,171 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 30 treesize of output 22 [2022-07-21 17:48:56,176 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-21 17:48:56,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:48:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645488351] [2022-07-21 17:48:56,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [645488351] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:48:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [472744617] [2022-07-21 17:48:56,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:48:56,374 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:48:56,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:48:56,375 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:48:56,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2022-07-21 17:48:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:48:56,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 17:48:56,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:48:56,549 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-21 17:48:56,792 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:48:56,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:48:56,969 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 11 treesize of output 7 [2022-07-21 17:48:57,220 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:48:57,221 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 29 treesize of output 30 [2022-07-21 17:48:57,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:48:57,657 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 32 treesize of output 27 [2022-07-21 17:48:57,816 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 26 treesize of output 14 [2022-07-21 17:48:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:48:58,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:00,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:49:00,251 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:49:00,262 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:00,262 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 20 treesize of output 21 [2022-07-21 17:49:00,267 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 34 treesize of output 26 [2022-07-21 17:49:00,273 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 9 [2022-07-21 17:49:08,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [472744617] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:08,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:08,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2022-07-21 17:49:08,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518482158] [2022-07-21 17:49:08,799 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:08,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 17:49:08,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:08,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 17:49:08,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1751, Unknown=6, NotChecked=348, Total=2256 [2022-07-21 17:49:08,801 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:49:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:11,200 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2022-07-21 17:49:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 17:49:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 38 [2022-07-21 17:49:11,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:11,203 INFO L225 Difference]: With dead ends: 211 [2022-07-21 17:49:11,203 INFO L226 Difference]: Without dead ends: 211 [2022-07-21 17:49:11,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=308, Invalid=2458, Unknown=6, NotChecked=420, Total=3192 [2022-07-21 17:49:11,204 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 514 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:11,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1134 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 799 Invalid, 0 Unknown, 101 Unchecked, 1.4s Time] [2022-07-21 17:49:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-21 17:49:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 109. [2022-07-21 17:49:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 104 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-07-21 17:49:11,208 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 38 [2022-07-21 17:49:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:11,208 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-07-21 17:49:11,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.8125) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-21 17:49:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-07-21 17:49:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-21 17:49:11,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:11,209 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-21 17:49:11,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:11,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:11,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:11,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:11,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:11,614 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2022-07-21 17:49:11,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:11,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996914535] [2022-07-21 17:49:11,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:11,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:11,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:11,616 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:11,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-21 17:49:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:11,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-21 17:49:11,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:11,804 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-21 17:49:11,826 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-21 17:49:12,163 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:49:12,163 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-21 17:49:12,176 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-21 17:49:12,295 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 11 treesize of output 7 [2022-07-21 17:49:12,307 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 11 treesize of output 7 [2022-07-21 17:49:12,479 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:49:12,480 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 38 treesize of output 37 [2022-07-21 17:49:12,486 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 18 treesize of output 20 [2022-07-21 17:49:12,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:12,866 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 31 treesize of output 26 [2022-07-21 17:49:12,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:12,892 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 21 treesize of output 20 [2022-07-21 17:49:13,012 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-21 17:49:13,016 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 25 treesize of output 13 [2022-07-21 17:49:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:49:13,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:14,810 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-07-21 17:49:14,855 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_621 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_621) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_620) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32)))))) is different from false [2022-07-21 17:49:14,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:14,873 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 37 treesize of output 30 [2022-07-21 17:49:14,877 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 44 treesize of output 32 [2022-07-21 17:49:14,886 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 15 treesize of output 11 [2022-07-21 17:49:14,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:14,915 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 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-21 17:49:14,929 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:14,930 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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-21 17:49:14,934 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:14,938 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 27 treesize of output 19 [2022-07-21 17:49:14,942 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:14,946 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 20 treesize of output 12 [2022-07-21 17:49:15,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996914535] [2022-07-21 17:49:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996914535] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432232621] [2022-07-21 17:49:15,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:15,667 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:49:15,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:49:15,668 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:49:15,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-07-21 17:49:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:15,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-21 17:49:15,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:15,922 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-21 17:49:15,930 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-21 17:49:16,153 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:49:16,154 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-21 17:49:16,181 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:49:16,181 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-21 17:49:16,244 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 11 treesize of output 7 [2022-07-21 17:49:16,261 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 11 treesize of output 7 [2022-07-21 17:49:16,332 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:49:16,332 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 38 treesize of output 37 [2022-07-21 17:49:16,338 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 18 treesize of output 20 [2022-07-21 17:49:16,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:16,434 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 31 treesize of output 26 [2022-07-21 17:49:16,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:16,453 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 21 treesize of output 20 [2022-07-21 17:49:16,520 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-21 17:49:16,524 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 25 treesize of output 13 [2022-07-21 17:49:16,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:49:16,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:17,509 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-07-21 17:49:17,559 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_683 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_683) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_682) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-07-21 17:49:17,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:17,576 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 37 treesize of output 30 [2022-07-21 17:49:17,580 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 44 treesize of output 32 [2022-07-21 17:49:17,587 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 15 treesize of output 11 [2022-07-21 17:49:17,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:17,616 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 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-21 17:49:17,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:17,634 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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-21 17:49:17,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:17,643 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 27 treesize of output 19 [2022-07-21 17:49:17,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:17,650 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 20 treesize of output 12 [2022-07-21 17:49:18,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1432232621] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:18,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:18,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2022-07-21 17:49:18,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691806051] [2022-07-21 17:49:18,019 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:18,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 17:49:18,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:18,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 17:49:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=800, Unknown=4, NotChecked=236, Total=1122 [2022-07-21 17:49:18,020 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:20,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:20,766 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2022-07-21 17:49:20,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 17:49:20,768 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-07-21 17:49:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:20,769 INFO L225 Difference]: With dead ends: 237 [2022-07-21 17:49:20,769 INFO L226 Difference]: Without dead ends: 237 [2022-07-21 17:49:20,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=175, Invalid=1319, Unknown=4, NotChecked=308, Total=1806 [2022-07-21 17:49:20,770 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 621 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:20,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 1192 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 654 Invalid, 0 Unknown, 126 Unchecked, 1.5s Time] [2022-07-21 17:49:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-21 17:49:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 117. [2022-07-21 17:49:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 112 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2022-07-21 17:49:20,773 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 38 [2022-07-21 17:49:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:20,774 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2022-07-21 17:49:20,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-07-21 17:49:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 17:49:20,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:20,775 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:20,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:20,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-21 17:49:21,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:21,178 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash 766820837, now seen corresponding path program 2 times [2022-07-21 17:49:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:21,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2136597939] [2022-07-21 17:49:21,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:49:21,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:21,180 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:21,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-21 17:49:21,303 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:49:21,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:49:21,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-21 17:49:21,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:49:21,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:21,555 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:49:21,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:21,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2136597939] [2022-07-21 17:49:21,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2136597939] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:49:21,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:21,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-07-21 17:49:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802099996] [2022-07-21 17:49:21,556 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:21,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:49:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:49:21,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:49:21,557 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:49:21,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:21,725 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-07-21 17:49:21,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 17:49:21,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-21 17:49:21,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:21,726 INFO L225 Difference]: With dead ends: 159 [2022-07-21 17:49:21,727 INFO L226 Difference]: Without dead ends: 159 [2022-07-21 17:49:21,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:49:21,727 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 200 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:21,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 374 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:49:21,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-21 17:49:21,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2022-07-21 17:49:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 98 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-07-21 17:49:21,730 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 41 [2022-07-21 17:49:21,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:21,731 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-21 17:49:21,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:49:21,731 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-07-21 17:49:21,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:49:21,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:21,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:21,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:21,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:21,941 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:21,941 INFO L85 PathProgramCache]: Analyzing trace with hash -168412858, now seen corresponding path program 2 times [2022-07-21 17:49:21,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:21,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062423539] [2022-07-21 17:49:21,942 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:49:21,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:21,943 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:21,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-21 17:49:22,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-21 17:49:22,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:49:22,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 17:49:22,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:49:22,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:49:22,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:22,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062423539] [2022-07-21 17:49:22,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062423539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:49:22,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:49:22,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 17:49:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503931606] [2022-07-21 17:49:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:49:22,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 17:49:22,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:22,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 17:49:22,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 17:49:22,063 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:22,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:22,114 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-07-21 17:49:22,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 17:49:22,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-21 17:49:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:22,115 INFO L225 Difference]: With dead ends: 105 [2022-07-21 17:49:22,115 INFO L226 Difference]: Without dead ends: 105 [2022-07-21 17:49:22,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-21 17:49:22,116 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 209 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-21 17:49:22,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 209 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:49:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-21 17:49:22,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2022-07-21 17:49:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.3375) internal successors, (107), 96 states have internal predecessors, (107), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-07-21 17:49:22,119 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 42 [2022-07-21 17:49:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:22,119 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-07-21 17:49:22,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-07-21 17:49:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-21 17:49:22,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:22,120 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:22,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:22,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:22,329 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:22,329 INFO L85 PathProgramCache]: Analyzing trace with hash -168412913, now seen corresponding path program 1 times [2022-07-21 17:49:22,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:22,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115528366] [2022-07-21 17:49:22,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:22,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:22,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:22,331 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:22,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-21 17:49:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:22,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:49:22,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:49:22,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:22,562 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-21 17:49:22,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:22,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115528366] [2022-07-21 17:49:22,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115528366] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:49:22,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:22,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-21 17:49:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189140972] [2022-07-21 17:49:22,562 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:22,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 17:49:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 17:49:22,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-21 17:49:22,563 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:22,752 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-21 17:49:22,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 17:49:22,753 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-07-21 17:49:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:22,754 INFO L225 Difference]: With dead ends: 146 [2022-07-21 17:49:22,754 INFO L226 Difference]: Without dead ends: 146 [2022-07-21 17:49:22,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-21 17:49:22,754 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 212 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:22,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 404 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:49:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-21 17:49:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2022-07-21 17:49:22,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 92 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-07-21 17:49:22,757 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 42 [2022-07-21 17:49:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:22,758 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-07-21 17:49:22,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:22,758 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-07-21 17:49:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:49:22,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:22,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:22,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:22,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:22,967 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:22,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:22,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923923, now seen corresponding path program 1 times [2022-07-21 17:49:22,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:22,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379159630] [2022-07-21 17:49:22,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:22,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:22,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:22,969 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:22,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-21 17:49:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:23,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:49:23,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:23,110 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-21 17:49:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:49:23,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:49:23,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:23,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379159630] [2022-07-21 17:49:23,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379159630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:49:23,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:49:23,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:49:23,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395045288] [2022-07-21 17:49:23,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:49:23,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:49:23,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:23,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:49:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:49:23,308 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:23,937 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-21 17:49:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:49:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-21 17:49:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:23,938 INFO L225 Difference]: With dead ends: 122 [2022-07-21 17:49:23,938 INFO L226 Difference]: Without dead ends: 122 [2022-07-21 17:49:23,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:49:23,939 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 273 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:23,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 264 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:49:23,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-21 17:49:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2022-07-21 17:49:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 95 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:23,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2022-07-21 17:49:23,942 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 45 [2022-07-21 17:49:23,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:23,942 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2022-07-21 17:49:23,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:23,942 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-07-21 17:49:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-21 17:49:23,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:23,943 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:23,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:24,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:24,148 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:24,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:24,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923924, now seen corresponding path program 1 times [2022-07-21 17:49:24,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:24,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159232991] [2022-07-21 17:49:24,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:24,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:24,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:24,149 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:24,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-21 17:49:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:24,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:49:24,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:24,295 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-21 17:49:24,622 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:49:24,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:49:24,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:24,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159232991] [2022-07-21 17:49:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159232991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:49:24,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:49:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:49:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563620652] [2022-07-21 17:49:24,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:49:24,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:49:24,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:24,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:49:24,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:49:24,623 INFO L87 Difference]: Start difference. First operand 100 states and 109 transitions. Second operand has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:25,274 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2022-07-21 17:49:25,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:49:25,275 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-21 17:49:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:25,275 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:49:25,275 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:49:25,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:49:25,276 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 413 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:25,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 264 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-21 17:49:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:49:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2022-07-21 17:49:25,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 95 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:25,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-21 17:49:25,279 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 45 [2022-07-21 17:49:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:25,279 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-21 17:49:25,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:25,279 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-21 17:49:25,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-21 17:49:25,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:25,280 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-21 17:49:25,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-21 17:49:25,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:25,488 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1217170439, now seen corresponding path program 3 times [2022-07-21 17:49:25,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315541210] [2022-07-21 17:49:25,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 17:49:25,489 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:25,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:25,490 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:25,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-21 17:49:25,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 17:49:25,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:49:25,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:49:25,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:49:25,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:26,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:26,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315541210] [2022-07-21 17:49:26,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315541210] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:26,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [450292347] [2022-07-21 17:49:26,295 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 17:49:26,295 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:49:26,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:49:26,297 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:49:26,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2022-07-21 17:49:26,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-21 17:49:26,593 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:49:26,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-21 17:49:26,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:26,655 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:49:26,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:26,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [450292347] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:26,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:26,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-21 17:49:26,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403079785] [2022-07-21 17:49:26,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:26,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 17:49:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 17:49:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-21 17:49:26,877 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:27,087 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-07-21 17:49:27,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:49:27,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-07-21 17:49:27,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:27,088 INFO L225 Difference]: With dead ends: 95 [2022-07-21 17:49:27,088 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:49:27,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:49:27,089 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 78 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:27,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 278 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:49:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:49:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:49:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2837837837837838) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-21 17:49:27,091 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2022-07-21 17:49:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:27,092 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-21 17:49:27,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-21 17:49:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 17:49:27,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:27,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:49:27,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-21 17:49:27,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2022-07-21 17:49:27,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 17:49:27,500 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash -399124699, now seen corresponding path program 1 times [2022-07-21 17:49:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:27,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937510744] [2022-07-21 17:49:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:27,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:27,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:27,502 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:27,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-21 17:49:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:27,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-21 17:49:27,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:27,766 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-21 17:49:27,946 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:49:27,946 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-21 17:49:28,045 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 11 treesize of output 7 [2022-07-21 17:49:28,173 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:49:28,174 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 19 treesize of output 22 [2022-07-21 17:49:28,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:28,467 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-21 17:49:28,478 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-21 17:49:28,693 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 16 treesize of output 8 [2022-07-21 17:49:28,871 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 16 treesize of output 18 [2022-07-21 17:49:29,136 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 19 treesize of output 11 [2022-07-21 17:49:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:49:29,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:29,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (bvmul (_ bv4294967295 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32))) is different from false [2022-07-21 17:49:29,775 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvmul (_ bv4294967295 32) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) |c_ULTIMATE.start_main_~len~0#1|) (_ bv0 32))) is different from false [2022-07-21 17:49:29,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (bvmul (_ bv4294967295 32) (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32))) is different from false [2022-07-21 17:49:29,808 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1111 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvmul (_ bv4294967295 32) (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|) v_ArrVal_1111) |c_ULTIMATE.start_main_~s~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|))) |c_ULTIMATE.start_main_~len~0#1|) (_ bv0 32))) is different from false [2022-07-21 17:49:29,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:29,834 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 40 treesize of output 41 [2022-07-21 17:49:29,861 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:29,861 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 72 treesize of output 75 [2022-07-21 17:49:29,871 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 29 treesize of output 25 [2022-07-21 17:49:30,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2022-07-21 17:49:30,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1106 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1106) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-21 17:49:30,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:30,861 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 19 treesize of output 20 [2022-07-21 17:49:30,865 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 25 [2022-07-21 17:49:30,870 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 6 treesize of output 4 [2022-07-21 17:49:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-21 17:49:31,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:31,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937510744] [2022-07-21 17:49:31,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937510744] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:49:31,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:31,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2022-07-21 17:49:31,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761857638] [2022-07-21 17:49:31,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:31,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-21 17:49:31,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-21 17:49:31,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1463, Unknown=6, NotChecked=486, Total=2070 [2022-07-21 17:49:31,729 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:49:35,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:35,243 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-21 17:49:35,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 17:49:35,244 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 49 [2022-07-21 17:49:35,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:35,244 INFO L225 Difference]: With dead ends: 94 [2022-07-21 17:49:35,244 INFO L226 Difference]: Without dead ends: 94 [2022-07-21 17:49:35,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=301, Invalid=2909, Unknown=6, NotChecked=690, Total=3906 [2022-07-21 17:49:35,246 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 212 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:35,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1260 Invalid, 1520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 903 Invalid, 0 Unknown, 565 Unchecked, 1.7s Time] [2022-07-21 17:49:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-21 17:49:35,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-21 17:49:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:35,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-21 17:49:35,248 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 49 [2022-07-21 17:49:35,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:35,248 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-21 17:49:35,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 41 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:49:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-21 17:49:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 17:49:35,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:35,248 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-07-21 17:49:35,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-21 17:49:35,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:35,458 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:35,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:35,458 INFO L85 PathProgramCache]: Analyzing trace with hash 780049028, now seen corresponding path program 1 times [2022-07-21 17:49:35,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:35,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117922886] [2022-07-21 17:49:35,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:35,458 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:35,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:35,459 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:35,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-21 17:49:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:35,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-21 17:49:35,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 17:49:35,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 17:49:35,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:35,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117922886] [2022-07-21 17:49:35,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117922886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:49:35,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:35,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 17:49:35,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195164300] [2022-07-21 17:49:35,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:35,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:49:35,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:49:35,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:49:35,748 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:35,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:49:35,870 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-07-21 17:49:35,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 17:49:35,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2022-07-21 17:49:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:49:35,871 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:49:35,871 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:49:35,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-07-21 17:49:35,872 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 115 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 17:49:35,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 514 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 17:49:35,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:49:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2022-07-21 17:49:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 93 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:49:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-07-21 17:49:35,874 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 55 [2022-07-21 17:49:35,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:49:35,874 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-07-21 17:49:35,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:49:35,874 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-07-21 17:49:35,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 17:49:35,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:49:35,875 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-07-21 17:49:35,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-21 17:49:36,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:49:36,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:49:36,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:49:36,084 INFO L85 PathProgramCache]: Analyzing trace with hash 780048973, now seen corresponding path program 1 times [2022-07-21 17:49:36,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:49:36,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [90781868] [2022-07-21 17:49:36,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:36,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:49:36,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:49:36,086 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:49:36,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-21 17:49:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:36,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-21 17:49:36,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:36,373 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-21 17:49:36,515 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:49:36,516 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-21 17:49:36,585 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 11 treesize of output 7 [2022-07-21 17:49:36,591 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 11 treesize of output 7 [2022-07-21 17:49:36,700 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:49:36,701 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 38 treesize of output 37 [2022-07-21 17:49:36,705 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 18 treesize of output 20 [2022-07-21 17:49:37,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:37,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 21 treesize of output 20 [2022-07-21 17:49:37,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:37,143 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 31 treesize of output 26 [2022-07-21 17:49:37,167 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 15 treesize of output 11 [2022-07-21 17:49:37,612 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-21 17:49:37,895 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 9 treesize of output 3 [2022-07-21 17:49:37,920 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:49:37,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 28 treesize of output 29 [2022-07-21 17:49:38,241 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 25 treesize of output 13 [2022-07-21 17:49:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:49:38,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:38,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:49:38,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (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|) v_ArrVal_1230) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:49:39,223 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1226 (_ BitVec 32)) (v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1226)) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1230)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (_ bv1 1))) is different from false [2022-07-21 17:49:39,409 INFO L356 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-07-21 17:49:39,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-21 17:49:39,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1226 (_ BitVec 32)) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1222))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1226)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1230))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-07-21 17:49:39,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1226 (_ BitVec 32)) (v_ArrVal_1222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1222))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1226)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1230))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-07-21 17:49:39,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:39,451 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 57 treesize of output 42 [2022-07-21 17:49:39,455 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 72 treesize of output 56 [2022-07-21 17:49:39,459 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 48 [2022-07-21 17:49:39,465 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-21 17:49:39,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:49:39,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [90781868] [2022-07-21 17:49:39,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [90781868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:39,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1800546541] [2022-07-21 17:49:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:49:39,885 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:49:39,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:49:39,886 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:49:39,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-21 17:49:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:49:40,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-21 17:49:40,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:49:40,252 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-21 17:49:40,721 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:49:40,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:49:40,925 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 11 treesize of output 7 [2022-07-21 17:49:41,128 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-21 17:49:41,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:49:41,605 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 21 treesize of output 20 [2022-07-21 17:49:41,613 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-21 17:49:41,901 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-21 17:49:42,212 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:49:42,212 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 41 treesize of output 44 [2022-07-21 17:49:42,218 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 17 treesize of output 11 [2022-07-21 17:49:42,221 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 24 treesize of output 18 [2022-07-21 17:49:43,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:49:43,241 INFO L356 Elim1Store]: treesize reduction 12, result has 57.1 percent of original size [2022-07-21 17:49:43,241 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 49 treesize of output 46 [2022-07-21 17:49:44,110 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 25 treesize of output 13 [2022-07-21 17:49:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:49:44,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:49:45,396 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 48 treesize of output 42 [2022-07-21 17:49:46,740 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-07-21 17:49:46,741 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 118 treesize of output 120 [2022-07-21 17:49:46,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:46,760 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 162 treesize of output 145 [2022-07-21 17:49:46,768 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 78 treesize of output 74 [2022-07-21 17:49:54,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:49:54,118 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 18 treesize of output 19 [2022-07-21 17:49:54,121 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 30 treesize of output 22 [2022-07-21 17:49:54,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 9 treesize of output 7 [2022-07-21 17:49:58,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1800546541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:49:58,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:49:58,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 47 [2022-07-21 17:49:58,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980781371] [2022-07-21 17:49:58,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:49:58,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-21 17:49:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:49:58,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-21 17:49:58,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=5613, Unknown=49, NotChecked=780, Total=6806 [2022-07-21 17:49:58,906 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 44 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:50:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:06,536 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2022-07-21 17:50:06,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 17:50:06,537 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 44 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55 [2022-07-21 17:50:06,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:06,537 INFO L225 Difference]: With dead ends: 157 [2022-07-21 17:50:06,537 INFO L226 Difference]: Without dead ends: 157 [2022-07-21 17:50:06,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 105 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2522 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=1100, Invalid=9173, Unknown=49, NotChecked=1020, Total=11342 [2022-07-21 17:50:06,544 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 758 mSDsluCounter, 1590 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1649 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 750 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:06,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1649 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 964 Invalid, 0 Unknown, 750 Unchecked, 1.5s Time] [2022-07-21 17:50:06,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-21 17:50:06,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2022-07-21 17:50:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-21 17:50:06,548 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 55 [2022-07-21 17:50:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:06,548 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-21 17:50:06,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 46 states have (on average 1.891304347826087) internal successors, (87), 44 states have internal predecessors, (87), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-21 17:50:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-21 17:50:06,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 17:50:06,549 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:06,549 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2022-07-21 17:50:06,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:06,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-21 17:50:06,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:06,952 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:06,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:06,952 INFO L85 PathProgramCache]: Analyzing trace with hash 780048974, now seen corresponding path program 1 times [2022-07-21 17:50:06,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:06,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209364056] [2022-07-21 17:50:06,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:06,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:06,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:06,954 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:06,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-21 17:50:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:07,287 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-21 17:50:07,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:07,301 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-21 17:50:07,307 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-21 17:50:07,574 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:50:07,574 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-21 17:50:07,609 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:50:07,609 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-21 17:50:07,729 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 11 treesize of output 7 [2022-07-21 17:50:07,737 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 11 treesize of output 7 [2022-07-21 17:50:07,883 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:07,883 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 38 treesize of output 37 [2022-07-21 17:50:07,888 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 18 treesize of output 20 [2022-07-21 17:50:08,264 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 15 treesize of output 11 [2022-07-21 17:50:08,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:08,273 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 21 treesize of output 20 [2022-07-21 17:50:08,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:08,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 31 treesize of output 26 [2022-07-21 17:50:08,875 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:08,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-21 17:50:08,880 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 18 treesize of output 20 [2022-07-21 17:50:08,893 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 9 treesize of output 3 [2022-07-21 17:50:09,086 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 25 treesize of output 13 [2022-07-21 17:50:09,090 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 15 treesize of output 7 [2022-07-21 17:50:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 17:50:09,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:09,808 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1370) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32)))))) is different from false [2022-07-21 17:50:09,845 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1370) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-21 17:50:09,880 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1370) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-07-21 17:50:09,917 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1370) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (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|) v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1))))) is different from false [2022-07-21 17:50:10,032 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1366)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1361)) .cse1 v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1370) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1361)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1366)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1368)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2022-07-21 17:50:10,094 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (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|) .cse0 v_ArrVal_1361)) .cse1 v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv8 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse2 .cse0 v_ArrVal_1366)) .cse1 v_ArrVal_1370) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse3 (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1361)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1368) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2022-07-21 17:50:10,125 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1361)) .cse1 v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse2 .cse0 v_ArrVal_1366)) .cse1 v_ArrVal_1370) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1361)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3))))) is different from false [2022-07-21 17:50:10,153 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1361)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1361)) .cse2 v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse3 .cse1 v_ArrVal_1366)) .cse2 v_ArrVal_1370) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2022-07-21 17:50:10,191 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1359))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1360))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1361))) .cse2 v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse4 .cse1 v_ArrVal_1366)) .cse2 v_ArrVal_1370) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1360))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1361))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1359) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse5) (bvadd (_ bv8 32) .cse5))))) is different from false [2022-07-21 17:50:10,250 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1360))) (store .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1361))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1359) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_1360 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1366 (_ BitVec 32)) (v_ArrVal_1370 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1368 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1361 (_ BitVec 32)) (v_ArrVal_1359 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1359))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1360))) (store .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse3 v_ArrVal_1361))) .cse4 v_ArrVal_1368) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse3 v_ArrVal_1366)) .cse4 v_ArrVal_1370) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2022-07-21 17:50:10,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:10,268 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 115 treesize of output 92 [2022-07-21 17:50:10,272 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 146 treesize of output 134 [2022-07-21 17:50:10,288 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:10,288 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 130 treesize of output 106 [2022-07-21 17:50:10,292 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 154 treesize of output 134 [2022-07-21 17:50:10,297 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 130 treesize of output 122 [2022-07-21 17:50:10,311 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 62 treesize of output 58 [2022-07-21 17:50:10,315 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 118 treesize of output 110 [2022-07-21 17:50:10,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:10,427 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 1 case distinctions, treesize of input 115 treesize of output 108 [2022-07-21 17:50:10,431 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:50:10,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 168 [2022-07-21 17:50:10,449 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:10,449 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 1 case distinctions, treesize of input 164 treesize of output 108 [2022-07-21 17:50:10,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:50:10,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 70 [2022-07-21 17:50:10,462 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-21 17:50:10,471 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-21 17:50:11,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209364056] [2022-07-21 17:50:11,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209364056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1932661451] [2022-07-21 17:50:11,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:11,103 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:50:11,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:50:11,104 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:50:11,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2022-07-21 17:50:11,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-21 17:50:11,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:11,440 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-21 17:50:11,445 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-21 17:50:11,891 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:50:11,891 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-21 17:50:11,910 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:50:11,910 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-21 17:50:12,163 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 11 treesize of output 7 [2022-07-21 17:50:12,363 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:12,363 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-21 17:50:12,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:12,744 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 31 treesize of output 26 [2022-07-21 17:50:13,057 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:13,057 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 53 treesize of output 50 [2022-07-21 17:50:13,062 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 39 [2022-07-21 17:50:13,626 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 24 [2022-07-21 17:50:13,630 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 34 treesize of output 18 [2022-07-21 17:50:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-21 17:50:13,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:14,967 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:14,968 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 138 treesize of output 125 [2022-07-21 17:50:14,977 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-21 17:50:15,085 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-21 17:50:16,658 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:16,659 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 43 treesize of output 35 [2022-07-21 17:50:16,663 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 65 treesize of output 53 [2022-07-21 17:50:16,668 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 49 treesize of output 45 [2022-07-21 17:50:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-21 17:50:18,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1932661451] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:18,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:50:18,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 23] total 66 [2022-07-21 17:50:18,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002832422] [2022-07-21 17:50:18,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:18,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-21 17:50:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-21 17:50:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=4546, Unknown=34, NotChecked=1450, Total=6320 [2022-07-21 17:50:18,277 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 67 states, 65 states have (on average 2.2) internal successors, (143), 59 states have internal predecessors, (143), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:50:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:21,975 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-07-21 17:50:21,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-21 17:50:21,976 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 2.2) internal successors, (143), 59 states have internal predecessors, (143), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2022-07-21 17:50:21,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:21,976 INFO L225 Difference]: With dead ends: 136 [2022-07-21 17:50:21,976 INFO L226 Difference]: Without dead ends: 136 [2022-07-21 17:50:21,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=521, Invalid=6967, Unknown=34, NotChecked=1790, Total=9312 [2022-07-21 17:50:21,978 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 276 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:21,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 1507 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 780 Invalid, 0 Unknown, 404 Unchecked, 1.3s Time] [2022-07-21 17:50:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-21 17:50:21,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 102. [2022-07-21 17:50:21,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2804878048780488) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-21 17:50:21,980 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 55 [2022-07-21 17:50:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:21,981 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-21 17:50:21,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 2.2) internal successors, (143), 59 states have internal predecessors, (143), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-21 17:50:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-21 17:50:21,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-21 17:50:21,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:21,981 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:21,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:22,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2022-07-21 17:50:22,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 17:50:22,392 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1039883103, now seen corresponding path program 1 times [2022-07-21 17:50:22,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:22,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247847715] [2022-07-21 17:50:22,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:22,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:22,393 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:22,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-21 17:50:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:22,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-21 17:50:22,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:22,688 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-21 17:50:22,825 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:50:22,825 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-21 17:50:22,904 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 11 treesize of output 7 [2022-07-21 17:50:22,911 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 11 treesize of output 7 [2022-07-21 17:50:23,012 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:23,013 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 29 treesize of output 30 [2022-07-21 17:50:23,017 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 18 treesize of output 20 [2022-07-21 17:50:23,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:23,297 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-21 17:50:23,304 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 15 treesize of output 11 [2022-07-21 17:50:23,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:23,321 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 21 treesize of output 20 [2022-07-21 17:50:23,922 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:23,922 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 62 treesize of output 59 [2022-07-21 17:50:23,928 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 47 treesize of output 36 [2022-07-21 17:50:23,933 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 37 treesize of output 37 [2022-07-21 17:50:24,525 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 23 [2022-07-21 17:50:24,528 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 34 treesize of output 22 [2022-07-21 17:50:24,712 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:50:24,712 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 40 treesize of output 24 [2022-07-21 17:50:24,871 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:50:24,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:25,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-07-21 17:50:25,679 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-07-21 17:50:25,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-07-21 17:50:25,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-21 17:50:25,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|))) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) is different from false [2022-07-21 17:50:25,801 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 656 treesize of output 588 [2022-07-21 17:50:26,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_145 (_ BitVec 32)) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_ArrVal_1504)))) (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse6 v_ArrVal_1505))) (.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse7 (bvadd (_ bv4 32) (select (select (store .cse10 .cse11 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (.cse5 (select (select (store .cse12 .cse11 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse9 (= .cse11 .cse5)) (.cse8 (= (bvadd (_ bv4 32) (select (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) .cse7)) (.cse4 (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32)))) (let ((.cse2 (and .cse9 .cse8 (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse4))) (.cse3 (or (not .cse8) (not .cse9))) (.cse1 (= .cse6 .cse7)) (.cse0 (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse5))) (or (and .cse0 .cse1 (or .cse2 (and .cse3 (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| .cse4)))) (and (or .cse2 (and (= v_arrayElimCell_145 .cse4) .cse3)) (or (not .cse1) (not .cse0))))))))))) is different from false [2022-07-21 17:50:28,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse6 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse4 (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse6 .cse5 v_ArrVal_1505)) .cse1 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse7 .cse5 v_ArrVal_1504)) .cse1 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))) (.cse0 (= .cse4 (bvadd (_ bv4 32) (select .cse6 |c_ULTIMATE.start_main_~s~0#1.offset|))))) (or (and .cse0 (= .cse1 .cse2) (= (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|) .cse3)) (and (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2) (= .cse4 .cse5) (= .cse3 (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (not .cse0)))))))) is different from false [2022-07-21 17:50:28,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse0 .cse1 v_ArrVal_1505)) .cse2 v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (bvadd (_ bv4 32) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse3 .cse1 v_ArrVal_1504)) .cse2 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse2))))) is different from false [2022-07-21 17:50:28,138 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1504)) .cse1 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse1)))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (= (bvadd (_ bv4 32) (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1505)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) is different from false [2022-07-21 17:50:28,162 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32)) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1504)) .cse2 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1498))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (= (bvadd (_ bv4 32) (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1505)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2022-07-21 17:50:28,198 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1498))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (= (bvadd (_ bv4 32) (select (select (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1505)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (bvadd (_ bv4 32) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32)) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1504)) .cse4 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse4)))))) is different from false [2022-07-21 17:50:28,210 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:28,210 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 76 treesize of output 61 [2022-07-21 17:50:28,214 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 120 treesize of output 112 [2022-07-21 17:50:28,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:28,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 54 [2022-07-21 17:50:28,231 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 80 treesize of output 68 [2022-07-21 17:50:28,234 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 64 treesize of output 60 [2022-07-21 17:50:28,236 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 60 treesize of output 56 [2022-07-21 17:50:28,241 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 28 treesize of output 26 [2022-07-21 17:50:28,264 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:50:28,264 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 1 case distinctions, treesize of input 72 treesize of output 1 [2022-07-21 17:50:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-21 17:50:28,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:28,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247847715] [2022-07-21 17:50:28,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247847715] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:28,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:50:28,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31] total 61 [2022-07-21 17:50:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165144874] [2022-07-21 17:50:28,996 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:28,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-21 17:50:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:28,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-21 17:50:28,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2318, Unknown=11, NotChecked=1166, Total=3660 [2022-07-21 17:50:28,997 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 61 states, 60 states have (on average 1.8) internal successors, (108), 55 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:50:35,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:35,168 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-07-21 17:50:35,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-21 17:50:35,169 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.8) internal successors, (108), 55 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2022-07-21 17:50:35,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:35,170 INFO L225 Difference]: With dead ends: 134 [2022-07-21 17:50:35,170 INFO L226 Difference]: Without dead ends: 134 [2022-07-21 17:50:35,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=346, Invalid=4379, Unknown=11, NotChecked=1584, Total=6320 [2022-07-21 17:50:35,171 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 112 mSDsluCounter, 2062 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 2118 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 988 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:35,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 2118 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1285 Invalid, 0 Unknown, 988 Unchecked, 2.2s Time] [2022-07-21 17:50:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-21 17:50:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 106. [2022-07-21 17:50:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.2674418604651163) internal successors, (109), 101 states have internal predecessors, (109), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-21 17:50:35,174 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 59 [2022-07-21 17:50:35,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:35,174 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-21 17:50:35,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.8) internal successors, (108), 55 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:50:35,174 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-21 17:50:35,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 17:50:35,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:35,175 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-21 17:50:35,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:35,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:35,385 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:35,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:35,385 INFO L85 PathProgramCache]: Analyzing trace with hash -786361131, now seen corresponding path program 1 times [2022-07-21 17:50:35,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:35,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222780802] [2022-07-21 17:50:35,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:35,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:35,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:35,387 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:35,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-21 17:50:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:35,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 17:50:35,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:35,600 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-21 17:50:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 17:50:35,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:35,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:35,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222780802] [2022-07-21 17:50:35,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222780802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:35,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:35,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:50:35,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498173706] [2022-07-21 17:50:35,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:35,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:50:35,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:50:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:50:35,819 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:36,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:36,333 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2022-07-21 17:50:36,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:50:36,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-21 17:50:36,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:36,334 INFO L225 Difference]: With dead ends: 124 [2022-07-21 17:50:36,334 INFO L226 Difference]: Without dead ends: 124 [2022-07-21 17:50:36,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:50:36,335 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 210 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:36,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 251 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 17:50:36,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-21 17:50:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2022-07-21 17:50:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.2777777777777777) internal successors, (115), 104 states have internal predecessors, (115), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2022-07-21 17:50:36,337 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 63 [2022-07-21 17:50:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:36,338 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2022-07-21 17:50:36,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2022-07-21 17:50:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-21 17:50:36,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:36,338 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-21 17:50:36,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:36,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:36,548 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:36,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:36,548 INFO L85 PathProgramCache]: Analyzing trace with hash -786361130, now seen corresponding path program 1 times [2022-07-21 17:50:36,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:36,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181395650] [2022-07-21 17:50:36,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:36,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:36,550 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:36,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-21 17:50:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:36,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-21 17:50:36,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:36,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, 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-21 17:50:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 17:50:36,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:36,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181395650] [2022-07-21 17:50:36,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181395650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:36,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:36,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 17:50:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952886835] [2022-07-21 17:50:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:36,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:50:36,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:36,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:50:36,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:50:36,961 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:37,370 INFO L93 Difference]: Finished difference Result 107 states and 116 transitions. [2022-07-21 17:50:37,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:50:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-21 17:50:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:37,371 INFO L225 Difference]: With dead ends: 107 [2022-07-21 17:50:37,371 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 17:50:37,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:50:37,372 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 215 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:37,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 196 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:50:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 17:50:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-21 17:50:37,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 102 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-07-21 17:50:37,374 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 63 [2022-07-21 17:50:37,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:37,374 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-07-21 17:50:37,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:37,375 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-07-21 17:50:37,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-21 17:50:37,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:37,375 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2022-07-21 17:50:37,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:37,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:37,579 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:37,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:37,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1392642591, now seen corresponding path program 1 times [2022-07-21 17:50:37,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:37,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647792513] [2022-07-21 17:50:37,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:37,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:37,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:37,581 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:37,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-21 17:50:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:37,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-21 17:50:37,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-21 17:50:37,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 17:50:37,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:37,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647792513] [2022-07-21 17:50:37,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647792513] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 17:50:37,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 17:50:37,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 17:50:37,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861136457] [2022-07-21 17:50:37,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 17:50:37,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:50:37,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:50:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:50:37,867 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:38,106 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2022-07-21 17:50:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:50:38,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2022-07-21 17:50:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:38,108 INFO L225 Difference]: With dead ends: 107 [2022-07-21 17:50:38,108 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 17:50:38,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:50:38,108 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 211 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:38,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 266 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 17:50:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 17:50:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-21 17:50:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 102 states have internal predecessors, (111), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:38,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2022-07-21 17:50:38,110 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 64 [2022-07-21 17:50:38,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:38,111 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2022-07-21 17:50:38,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:38,111 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2022-07-21 17:50:38,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-21 17:50:38,112 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:38,112 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-21 17:50:38,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:38,320 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:38,320 INFO L85 PathProgramCache]: Analyzing trace with hash 255494975, now seen corresponding path program 1 times [2022-07-21 17:50:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695875502] [2022-07-21 17:50:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:38,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:38,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:38,322 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:38,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-21 17:50:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:38,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-21 17:50:38,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 17:50:38,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-21 17:50:38,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:38,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695875502] [2022-07-21 17:50:38,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695875502] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:38,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:50:38,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-21 17:50:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261467903] [2022-07-21 17:50:38,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:38,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 17:50:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 17:50:38,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:50:38,725 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:50:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:38,776 INFO L93 Difference]: Finished difference Result 87 states and 89 transitions. [2022-07-21 17:50:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 17:50:38,776 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 65 [2022-07-21 17:50:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:38,777 INFO L225 Difference]: With dead ends: 87 [2022-07-21 17:50:38,777 INFO L226 Difference]: Without dead ends: 87 [2022-07-21 17:50:38,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-21 17:50:38,777 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 148 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:38,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 226 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 17:50:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-21 17:50:38,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-21 17:50:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2022-07-21 17:50:38,779 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 65 [2022-07-21 17:50:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:38,779 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2022-07-21 17:50:38,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:50:38,779 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2022-07-21 17:50:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 17:50:38,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:38,780 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:38,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:38,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:38,988 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:38,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:38,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740515, now seen corresponding path program 1 times [2022-07-21 17:50:38,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:38,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1707234161] [2022-07-21 17:50:38,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:38,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:38,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:38,990 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:38,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-21 17:50:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:39,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-21 17:50:39,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:39,235 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 9 [2022-07-21 17:50:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 17:50:39,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:39,283 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-21 17:50:39,284 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 16 treesize of output 15 [2022-07-21 17:50:39,302 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-21 17:50:39,302 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 11 treesize of output 11 [2022-07-21 17:50:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 17:50:39,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:39,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1707234161] [2022-07-21 17:50:39,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1707234161] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:39,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:50:39,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-21 17:50:39,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079920511] [2022-07-21 17:50:39,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:39,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 17:50:39,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:39,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 17:50:39,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 17:50:39,317 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:39,703 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-07-21 17:50:39,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 17:50:39,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 66 [2022-07-21 17:50:39,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:39,704 INFO L225 Difference]: With dead ends: 95 [2022-07-21 17:50:39,704 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 17:50:39,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-07-21 17:50:39,705 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 89 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:39,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 316 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 17:50:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 17:50:39,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-07-21 17:50:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.131578947368421) internal successors, (86), 82 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2022-07-21 17:50:39,706 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 66 [2022-07-21 17:50:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:39,707 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2022-07-21 17:50:39,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-21 17:50:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2022-07-21 17:50:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-21 17:50:39,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:39,707 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:39,715 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-21 17:50:39,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:39,916 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:39,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:39,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740514, now seen corresponding path program 1 times [2022-07-21 17:50:39,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:39,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786413149] [2022-07-21 17:50:39,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:39,917 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:39,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:39,918 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:39,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-21 17:50:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:40,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-21 17:50:40,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:40,233 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-21 17:50:40,239 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-21 17:50:40,441 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 17:50:40,441 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-21 17:50:40,460 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:50:40,461 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-21 17:50:40,557 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 11 treesize of output 7 [2022-07-21 17:50:40,562 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 11 treesize of output 7 [2022-07-21 17:50:40,680 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:40,680 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 38 treesize of output 37 [2022-07-21 17:50:40,684 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 18 treesize of output 20 [2022-07-21 17:50:40,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:40,966 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 31 treesize of output 26 [2022-07-21 17:50:40,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:40,982 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 21 treesize of output 20 [2022-07-21 17:50:40,990 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 15 treesize of output 11 [2022-07-21 17:50:41,518 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:41,518 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 38 treesize of output 37 [2022-07-21 17:50:41,522 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 18 treesize of output 20 [2022-07-21 17:50:41,532 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 9 treesize of output 3 [2022-07-21 17:50:41,917 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-21 17:50:41,920 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 25 treesize of output 13 [2022-07-21 17:50:42,044 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-21 17:50:42,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:42,674 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2022-07-21 17:50:42,704 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-21 17:50:42,726 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-21 17:50:42,755 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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|) v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-21 17:50:42,819 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1838 (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1838)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_1839)) .cse1 v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1838 (_ BitVec 32))) (let ((.cse3 (select (select (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1839)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse4 v_ArrVal_1838)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1842)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2022-07-21 17:50:42,875 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1838 (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) (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|) .cse0 v_ArrVal_1839)) .cse1 v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse2 .cse0 v_ArrVal_1838)) .cse1 v_ArrVal_1843) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32))) (let ((.cse3 (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1839)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1842) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2022-07-21 17:50:42,902 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1839)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1838 (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1839)) .cse2 v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse3 .cse1 v_ArrVal_1838)) .cse2 v_ArrVal_1843) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))) is different from false [2022-07-21 17:50:42,929 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1838 (_ BitVec 32)) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_1839)) .cse1 v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 .cse0 v_ArrVal_1838)) .cse1 v_ArrVal_1843) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1839)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2022-07-21 17:50:42,965 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1838 (_ BitVec 32)) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1832))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1833))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1839))) .cse2 v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse4 .cse1 v_ArrVal_1838)) .cse2 v_ArrVal_1843) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1833))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1839))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))) is different from false [2022-07-21 17:50:43,011 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1838 (_ BitVec 32)) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1843 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1832))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1833))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1839))) .cse2 v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_1838)) .cse2 v_ArrVal_1843) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_1842 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1839 (_ BitVec 32)) (v_ArrVal_1832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1833 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1833))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1839))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1832) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1842) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))) is different from false [2022-07-21 17:50:43,028 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:43,028 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 113 treesize of output 90 [2022-07-21 17:50:43,031 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 138 treesize of output 126 [2022-07-21 17:50:43,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:43,040 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 122 treesize of output 98 [2022-07-21 17:50:43,044 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 146 treesize of output 126 [2022-07-21 17:50:43,061 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 122 treesize of output 114 [2022-07-21 17:50:43,071 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-21 17:50:43,074 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-21 17:50:43,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:43,159 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 1 case distinctions, treesize of input 115 treesize of output 108 [2022-07-21 17:50:43,162 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:50:43,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 168 [2022-07-21 17:50:43,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:43,176 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 1 case distinctions, treesize of input 164 treesize of output 108 [2022-07-21 17:50:43,180 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:50:43,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 70 [2022-07-21 17:50:43,188 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-21 17:50:43,195 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-21 17:50:43,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:43,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786413149] [2022-07-21 17:50:43,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786413149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:43,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1835931344] [2022-07-21 17:50:43,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:43,724 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:50:43,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:50:43,725 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:50:43,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2022-07-21 17:50:44,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:44,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-21 17:50:44,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:44,110 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-21 17:50:44,114 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-21 17:50:44,345 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:50:44,345 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-21 17:50:44,354 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-21 17:50:44,507 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 11 treesize of output 7 [2022-07-21 17:50:44,517 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 11 treesize of output 7 [2022-07-21 17:50:44,704 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:44,705 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 38 treesize of output 37 [2022-07-21 17:50:44,713 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 18 treesize of output 20 [2022-07-21 17:50:45,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:45,021 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 31 treesize of output 26 [2022-07-21 17:50:45,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:50:45,040 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 21 treesize of output 20 [2022-07-21 17:50:45,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:50:45,312 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 38 treesize of output 37 [2022-07-21 17:50:45,316 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 18 treesize of output 20 [2022-07-21 17:50:45,619 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-21 17:50:45,623 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 25 treesize of output 13 [2022-07-21 17:50:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:50:45,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:45,915 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) is different from false [2022-07-21 17:50:45,953 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-21 17:50:45,974 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-21 17:50:46,005 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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|) v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-21 17:50:46,062 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1910 (_ BitVec 32)) (v_ArrVal_1911 (_ BitVec 32))) (let ((.cse0 (select (select (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_1911)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_1910)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1913)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1910 (_ BitVec 32)) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_ArrVal_1910)))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse2 v_ArrVal_1911)) .cse3 v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-21 17:50:46,114 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32))) (let ((.cse0 (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1911)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1910 (_ BitVec 32)) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule (bvadd (_ bv4 32) (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|) .cse1 v_ArrVal_1911)) .cse2 v_ArrVal_1913) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 .cse1 v_ArrVal_1910)) .cse2 v_ArrVal_1912) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-07-21 17:50:46,140 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1910 (_ BitVec 32)) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse0 v_ArrVal_1911)) .cse1 v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse2 .cse0 v_ArrVal_1910)) .cse1 v_ArrVal_1912) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1911)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2022-07-21 17:50:46,167 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1910 (_ BitVec 32)) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_1911)) .cse1 v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse2 .cse0 v_ArrVal_1910)) .cse1 v_ArrVal_1912) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1911)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))) is different from false [2022-07-21 17:50:46,211 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32))) (let ((.cse0 (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1907))) (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1911))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1910 (_ BitVec 32)) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1906))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1907))) (store .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse3 v_ArrVal_1911))) .cse4 v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse6 .cse3 v_ArrVal_1910)) .cse4 v_ArrVal_1912) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))) is different from false [2022-07-21 17:50:46,271 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1910 (_ BitVec 32)) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32)) (v_ArrVal_1912 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1906))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse2 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1907))) (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1911))) .cse2 v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse4 .cse1 v_ArrVal_1910)) .cse2 v_ArrVal_1912) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1906 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1907 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1911 (_ BitVec 32))) (let ((.cse5 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1907))) (store .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1911))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1906) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1913) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))) is different from false [2022-07-21 17:50:46,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:46,299 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 113 treesize of output 90 [2022-07-21 17:50:46,303 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 138 treesize of output 126 [2022-07-21 17:50:46,318 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:46,319 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 122 treesize of output 98 [2022-07-21 17:50:46,322 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 146 treesize of output 126 [2022-07-21 17:50:46,325 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 122 treesize of output 114 [2022-07-21 17:50:46,328 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 114 treesize of output 106 [2022-07-21 17:50:46,338 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 54 treesize of output 50 [2022-07-21 17:50:46,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:46,442 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 1 case distinctions, treesize of input 115 treesize of output 108 [2022-07-21 17:50:46,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:50:46,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 168 [2022-07-21 17:50:46,458 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:46,459 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 1 case distinctions, treesize of input 164 treesize of output 108 [2022-07-21 17:50:46,461 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:50:46,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 70 [2022-07-21 17:50:46,475 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-21 17:50:46,481 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-21 17:50:46,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1835931344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:50:46,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:50:46,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 23] total 40 [2022-07-21 17:50:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255404340] [2022-07-21 17:50:46,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:46,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-21 17:50:46,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:46,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-21 17:50:46,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2117, Unknown=20, NotChecked=2220, Total=4556 [2022-07-21 17:50:46,820 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 41 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 36 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:50:51,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:51,838 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2022-07-21 17:50:51,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 17:50:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 36 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 66 [2022-07-21 17:50:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:51,840 INFO L225 Difference]: With dead ends: 96 [2022-07-21 17:50:51,840 INFO L226 Difference]: Without dead ends: 96 [2022-07-21 17:50:51,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 156 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=541, Invalid=4075, Unknown=20, NotChecked=3020, Total=7656 [2022-07-21 17:50:51,841 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 492 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 127 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:51,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 543 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 948 Invalid, 0 Unknown, 127 Unchecked, 1.4s Time] [2022-07-21 17:50:51,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-21 17:50:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 89. [2022-07-21 17:50:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.1153846153846154) internal successors, (87), 84 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:51,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2022-07-21 17:50:51,843 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 66 [2022-07-21 17:50:51,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:51,843 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2022-07-21 17:50:51,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 36 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:50:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2022-07-21 17:50:51,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 17:50:51,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:51,844 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:51,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:52,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:52,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-21 17:50:52,254 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:52,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:52,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2119617500, now seen corresponding path program 1 times [2022-07-21 17:50:52,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:52,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150865419] [2022-07-21 17:50:52,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:52,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:52,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:52,256 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:52,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-21 17:50:52,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:52,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-21 17:50:52,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:50:53,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:53,317 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 38 treesize of output 36 [2022-07-21 17:50:53,714 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 25 treesize of output 17 [2022-07-21 17:50:53,718 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 13 [2022-07-21 17:50:53,817 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-21 17:50:53,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:50:54,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:54,376 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 30 [2022-07-21 17:50:54,391 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:54,391 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 23 treesize of output 26 [2022-07-21 17:50:55,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:50:55,243 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 24 treesize of output 27 [2022-07-21 17:50:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-21 17:50:55,397 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:50:55,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150865419] [2022-07-21 17:50:55,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150865419] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:50:55,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:50:55,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2022-07-21 17:50:55,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185212635] [2022-07-21 17:50:55,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:50:55,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-21 17:50:55,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:50:55,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-21 17:50:55,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1661, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 17:50:55,399 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 42 states have internal predecessors, (101), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:50:59,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:50:59,437 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-07-21 17:50:59,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 17:50:59,438 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 42 states have internal predecessors, (101), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 67 [2022-07-21 17:50:59,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:50:59,438 INFO L225 Difference]: With dead ends: 86 [2022-07-21 17:50:59,438 INFO L226 Difference]: Without dead ends: 86 [2022-07-21 17:50:59,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=568, Invalid=3592, Unknown=0, NotChecked=0, Total=4160 [2022-07-21 17:50:59,439 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 533 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:50:59,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 437 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 903 Invalid, 0 Unknown, 27 Unchecked, 1.4s Time] [2022-07-21 17:50:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-21 17:50:59,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-21 17:50:59,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 75 states have (on average 1.0933333333333333) internal successors, (82), 81 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:50:59,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2022-07-21 17:50:59,441 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 67 [2022-07-21 17:50:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:50:59,441 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2022-07-21 17:50:59,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.3488372093023258) internal successors, (101), 42 states have internal predecessors, (101), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-21 17:50:59,441 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-07-21 17:50:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-21 17:50:59,442 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:50:59,442 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:50:59,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-21 17:50:59,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:50:59,650 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:50:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:50:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1139341665, now seen corresponding path program 1 times [2022-07-21 17:50:59,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:50:59,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559043887] [2022-07-21 17:50:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:50:59,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:50:59,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:50:59,652 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:50:59,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-21 17:50:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:50:59,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-21 17:50:59,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:00,069 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-21 17:51:00,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-21 17:51:00,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 17:51:00,254 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-21 17:51:00,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-07-21 17:51:00,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:51:00,471 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:51:00,471 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 1 case distinctions, treesize of input 34 treesize of output 33 [2022-07-21 17:51:00,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:00,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-07-21 17:51:01,002 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:51:01,003 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 1 case distinctions, treesize of input 34 treesize of output 33 [2022-07-21 17:51:01,340 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 31 treesize of output 15 [2022-07-21 17:51:01,476 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-21 17:51:01,476 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:01,764 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2027) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:01,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2027) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:01,904 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (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|) v_ArrVal_2027) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:02,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2026 (_ BitVec 32)) (v_ArrVal_2027 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2026)) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2027)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:03,076 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:03,076 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 57 treesize of output 42 [2022-07-21 17:51:03,080 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 72 treesize of output 56 [2022-07-21 17:51:03,097 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 48 [2022-07-21 17:51:03,103 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-21 17:51:03,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:03,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559043887] [2022-07-21 17:51:03,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559043887] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [708550154] [2022-07-21 17:51:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:03,564 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:51:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:51:03,565 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:51:03,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-07-21 17:51:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:03,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-21 17:51:03,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:03,982 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-21 17:51:04,407 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-21 17:51:04,476 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:51:04,476 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-21 17:51:04,716 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 11 treesize of output 7 [2022-07-21 17:51:05,000 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:51:05,001 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-21 17:51:05,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:05,513 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-21 17:51:05,841 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-21 17:51:05,842 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-21 17:51:06,371 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 23 treesize of output 11 [2022-07-21 17:51:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-21 17:51:06,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:06,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2086) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:06,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2086) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:06,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (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|) v_ArrVal_2086) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:06,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2084 (_ BitVec 32))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2084)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2086)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:07,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2084 (_ BitVec 32))) (bvult (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2084)) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2086)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:07,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2084 (_ BitVec 32)) (v_ArrVal_2083 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2083))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (store (store .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse1 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2084)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2086))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-21 17:51:07,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:07,867 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 57 treesize of output 42 [2022-07-21 17:51:07,870 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 72 treesize of output 56 [2022-07-21 17:51:07,874 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 48 [2022-07-21 17:51:07,879 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-21 17:51:08,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [708550154] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:08,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 17:51:08,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2022-07-21 17:51:08,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912904142] [2022-07-21 17:51:08,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 17:51:08,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 17:51:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 17:51:08,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 17:51:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2795, Unknown=213, NotChecked=1190, Total=4422 [2022-07-21 17:51:08,194 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 37 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:51:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:51:13,931 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-07-21 17:51:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 17:51:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 37 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 69 [2022-07-21 17:51:13,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:51:13,932 INFO L225 Difference]: With dead ends: 106 [2022-07-21 17:51:13,932 INFO L226 Difference]: Without dead ends: 106 [2022-07-21 17:51:13,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 169 SyntacticMatches, 3 SemanticMatches, 86 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=559, Invalid=5254, Unknown=233, NotChecked=1610, Total=7656 [2022-07-21 17:51:13,933 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 224 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 1237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:51:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 632 Invalid, 1237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 17:51:13,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-21 17:51:13,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2022-07-21 17:51:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 76 states have (on average 1.0921052631578947) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-21 17:51:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-07-21 17:51:13,935 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 69 [2022-07-21 17:51:13,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:51:13,935 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-07-21 17:51:13,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.5609756097560976) internal successors, (105), 37 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-21 17:51:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-07-21 17:51:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-21 17:51:13,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:51:13,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:51:13,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:14,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-07-21 17:51:14,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 17:51:14,344 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-21 17:51:14,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:51:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash -998839710, now seen corresponding path program 1 times [2022-07-21 17:51:14,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 17:51:14,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821936352] [2022-07-21 17:51:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:14,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 17:51:14,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 17:51:14,346 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 17:51:14,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-21 17:51:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:14,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-21 17:51:14,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:14,691 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-21 17:51:14,835 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:51:14,835 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-21 17:51:14,898 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 11 treesize of output 7 [2022-07-21 17:51:15,010 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 17:51:15,011 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 47 treesize of output 33 [2022-07-21 17:51:15,014 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 19 treesize of output 11 [2022-07-21 17:51:15,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:15,227 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:51:15,227 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-07-21 17:51:15,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 18 treesize of output 20 [2022-07-21 17:51:15,570 INFO L356 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-07-21 17:51:15,570 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 81 treesize of output 72 [2022-07-21 17:51:15,596 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-21 17:51:15,596 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 59 [2022-07-21 17:51:16,347 INFO L356 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-07-21 17:51:16,347 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 73 treesize of output 56 [2022-07-21 17:51:16,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:16,367 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 45 treesize of output 33 [2022-07-21 17:51:16,719 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 17:51:16,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:28,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2148 (_ BitVec 32)) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2150 (_ BitVec 32))) (or (and (forall ((v_ArrVal_2153 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2149)) (.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2148)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (select (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2150)) (select (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2153)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32)))) (forall ((v_ArrVal_2153 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2148)))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse5 .cse6 (store (select .cse5 .cse6) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2149) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2153)))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32))))) (not (= (select (select (let ((.cse8 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2148)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2149))) (store .cse7 .cse8 (store (select .cse7 .cse8) (bvadd (_ bv4 32) (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2150))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32))))) is different from false [2022-07-21 17:51:28,198 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2148 (_ BitVec 32)) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2150 (_ BitVec 32))) (or (and (forall ((v_ArrVal_2153 (_ BitVec 32))) (= (select (let ((.cse0 (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2148))) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2153)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32)) |c_ULTIMATE.start_main_~s~0#1.base|)) (forall ((v_ArrVal_2153 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2149))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_2150))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2148)))) (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_2153))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32))))) (not (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2149)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2150))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32))))) is different from false [2022-07-21 17:51:28,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2150 (_ BitVec 32))) (or (and (forall ((v_ArrVal_2148 (_ BitVec 32)) (v_ArrVal_2153 (_ BitVec 32))) (= (select (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse2 (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2149))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2150))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2148)))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2153))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (forall ((v_ArrVal_2148 (_ BitVec 32)) (v_ArrVal_2153 (_ BitVec 32))) (= (select (let ((.cse5 (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2148))) (.cse7 (select .cse8 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (store .cse6 .cse7 (store (select .cse6 .cse7) (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) v_ArrVal_2153)))))) (select .cse5 (select (select .cse5 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (not (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2149)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) v_ArrVal_2150))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv0 32))))) is different from false [2022-07-21 17:51:28,347 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2150 (_ BitVec 32))) (or (and (forall ((v_ArrVal_2148 (_ BitVec 32)) (v_ArrVal_2153 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse0 (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2148))) (.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_2153)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (_ bv0 32)))) (forall ((v_ArrVal_2148 (_ BitVec 32)) (v_ArrVal_2153 (_ BitVec 32))) (= (select (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse6 (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2149))) (store .cse4 .cse5 (store (select .cse4 .cse5) .cse6 v_ArrVal_2150))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2148)))) (store .cse7 .cse5 (store (select .cse7 .cse5) .cse6 v_ArrVal_2153))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (_ bv0 32)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (not (= (select (select (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2149)) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse9 .cse10 (store (select .cse9 .cse10) (bvadd (_ bv4 32) (select v_ArrVal_2149 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_2150))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv0 32))))) is different from false [2022-07-21 17:51:28,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:28,382 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 412 treesize of output 388 [2022-07-21 17:51:28,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:28,571 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 2857 treesize of output 2763 [2022-07-21 17:51:28,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:28,825 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 839 treesize of output 815 [2022-07-21 17:51:29,029 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 6 treesize of output 4 [2022-07-21 17:51:30,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:30,053 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 580 treesize of output 580 [2022-07-21 17:51:30,837 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 6 treesize of output 4 [2022-07-21 17:51:30,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:51:30,884 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-21 17:51:30,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:51:30,987 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 333 treesize of output 337 [2022-07-21 17:51:31,100 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 6 treesize of output 4 [2022-07-21 17:51:38,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:51:45,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 17:51:45,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821936352] [2022-07-21 17:51:45,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821936352] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:51:45,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60374881] [2022-07-21 17:51:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:51:45,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-21 17:51:45,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-21 17:51:45,412 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-21 17:51:45,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2022-07-21 17:51:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:51:45,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-21 17:51:45,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:51:45,910 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-21 17:51:46,344 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-21 17:51:46,344 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-21 17:51:46,623 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 11 treesize of output 7 [2022-07-21 17:51:46,631 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 11 treesize of output 7 [2022-07-21 17:51:46,961 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-21 17:51:46,961 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 38 treesize of output 28 [2022-07-21 17:51:46,965 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 18 treesize of output 20 [2022-07-21 17:51:47,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:47,658 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 21 treesize of output 20 [2022-07-21 17:51:47,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 17:51:47,671 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:51:47,671 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-21 17:51:47,774 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-21 17:51:48,165 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-21 17:51:48,166 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2022-07-21 17:51:48,698 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 7 treesize of output 3 [2022-07-21 17:51:49,342 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-21 17:51:49,342 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 34 treesize of output 25 [2022-07-21 17:51:49,905 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 15 treesize of output 17 [2022-07-21 17:51:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-21 17:51:50,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:51:50,996 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 65 treesize of output 49 [2022-07-21 17:52:43,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2217 (_ BitVec 32)) (v_ArrVal_2219 (_ BitVec 32)) (v_ArrVal_2214 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2217))) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2214) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_2219))))))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= (_ bv0 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (let ((.cse1 (select (select .cse2 .cse0) (_ bv0 32)))) (and (not (= .cse1 .cse0)) (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| .cse1))) (_ bv0 1)))))))) is different from false [2022-07-21 17:52:44,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2217 (_ BitVec 32)) (v_ArrVal_2219 (_ BitVec 32)) (v_ArrVal_2214 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (store .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2217))) (.cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store .cse3 .cse4 (store (select .cse3 .cse4) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2214) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2219))))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (let ((.cse0 (select (select .cse2 .cse1) (_ bv0 32)))) (and (= (bvadd (bvneg (select |c_#valid| .cse0)) (_ bv1 1)) (_ bv0 1)) (not (= .cse1 .cse0)))) (and (= .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| (_ bv0 32))))))) is different from false [2022-07-21 17:52:44,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:52:44,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 303694 treesize of output 303230