./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 791161d1 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-?-791161d [2022-07-23 06:35:42,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:35:42,308 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:35:42,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:35:42,344 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:35:42,345 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:35:42,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:35:42,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:35:42,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:35:42,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:35:42,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:35:42,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:35:42,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:35:42,356 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:35:42,357 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:35:42,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:35:42,359 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:35:42,360 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:35:42,361 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:35:42,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:35:42,367 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:35:42,368 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:35:42,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:35:42,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:35:42,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:35:42,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:35:42,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:35:42,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:35:42,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:35:42,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:35:42,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:35:42,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:35:42,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:35:42,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:35:42,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:35:42,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:35:42,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:35:42,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:35:42,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:35:42,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:35:42,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:35:42,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:35:42,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 06:35:42,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:35:42,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:35:42,408 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:35:42,408 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:35:42,409 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:35:42,409 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:35:42,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:35:42,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:35:42,409 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:35:42,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:35:42,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:35:42,411 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:35:42,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:35:42,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:35:42,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:35:42,411 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:35:42,411 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:35:42,411 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:35:42,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:35:42,412 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:35:42,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:35:42,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:35:42,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:35:42,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:35:42,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:35:42,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:35:42,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:35:42,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:35:42,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 06:35:42,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 06:35:42,414 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-23 06:35:42,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:35:42,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:35:42,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:35:42,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:35:42,613 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:35:42,614 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-23 06:35:42,660 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecfa89ab/84cda6e3e4bf40078ab82f4e8ec118f5/FLAG2a6a4f9a1 [2022-07-23 06:35:43,038 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:35:43,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-23 06:35:43,045 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecfa89ab/84cda6e3e4bf40078ab82f4e8ec118f5/FLAG2a6a4f9a1 [2022-07-23 06:35:43,056 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ecfa89ab/84cda6e3e4bf40078ab82f4e8ec118f5 [2022-07-23 06:35:43,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:35:43,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:35:43,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:35:43,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:35:43,064 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:35:43,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f06454d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43, skipping insertion in model container [2022-07-23 06:35:43,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:35:43,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:35:43,383 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-23 06:35:43,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:35:43,390 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:35:43,438 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-23 06:35:43,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:35:43,466 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:35:43,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43 WrapperNode [2022-07-23 06:35:43,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:35:43,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:35:43,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:35:43,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:35:43,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,490 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,507 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-07-23 06:35:43,509 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:35:43,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:35:43,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:35:43,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:35:43,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,523 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:35:43,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:35:43,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:35:43,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:35:43,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (1/1) ... [2022-07-23 06:35:43,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:35:43,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:43,598 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-23 06:35:43,626 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-23 06:35:43,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 06:35:43,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 06:35:43,668 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:35:43,669 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:35:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:35:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:35:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:35:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:35:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:35:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 06:35:43,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:35:43,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:35:43,807 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:35:43,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:35:44,056 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:35:44,061 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:35:44,061 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-23 06:35:44,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:35:44 BoogieIcfgContainer [2022-07-23 06:35:44,063 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:35:44,064 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:35:44,064 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:35:44,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:35:44,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:35:43" (1/3) ... [2022-07-23 06:35:44,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c14eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:35:44, skipping insertion in model container [2022-07-23 06:35:44,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:35:43" (2/3) ... [2022-07-23 06:35:44,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30c14eab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:35:44, skipping insertion in model container [2022-07-23 06:35:44,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:35:44" (3/3) ... [2022-07-23 06:35:44,074 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-07-23 06:35:44,106 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:35:44,107 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-23 06:35:44,144 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:35:44,150 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@39a73d2c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3614d858 [2022-07-23 06:35:44,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-23 06:35:44,155 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-23 06:35:44,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:35:44,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:44,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:35:44,161 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-23 06:35:44,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:44,165 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-07-23 06:35:44,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:44,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131219671] [2022-07-23 06:35:44,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:44,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:44,288 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-23 06:35:44,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:44,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131219671] [2022-07-23 06:35:44,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131219671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:44,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:44,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:35:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992684748] [2022-07-23 06:35:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:44,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:35:44,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:44,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:35:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:35:44,318 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-23 06:35:44,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:44,396 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-23 06:35:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:35:44,400 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-23 06:35:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:44,415 INFO L225 Difference]: With dead ends: 81 [2022-07-23 06:35:44,416 INFO L226 Difference]: Without dead ends: 78 [2022-07-23 06:35:44,417 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-23 06:35:44,420 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:35:44,422 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.0s Time] [2022-07-23 06:35:44,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-23 06:35:44,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-23 06:35:44,449 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-23 06:35:44,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-23 06:35:44,453 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-07-23 06:35:44,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:44,453 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-23 06:35:44,454 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-23 06:35:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-23 06:35:44,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:35:44,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:44,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:35:44,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 06:35:44,455 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-23 06:35:44,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:44,456 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-07-23 06:35:44,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:44,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300830778] [2022-07-23 06:35:44,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:44,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:44,530 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-23 06:35:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:44,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300830778] [2022-07-23 06:35:44,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300830778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:44,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:44,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:35:44,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476742222] [2022-07-23 06:35:44,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:44,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:35:44,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:44,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:35:44,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:35:44,542 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-23 06:35:44,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:44,586 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-23 06:35:44,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:35:44,587 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-23 06:35:44,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:44,587 INFO L225 Difference]: With dead ends: 76 [2022-07-23 06:35:44,588 INFO L226 Difference]: Without dead ends: 76 [2022-07-23 06:35:44,588 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-23 06:35:44,589 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-23 06:35:44,589 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-23 06:35:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-23 06:35:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-23 06:35:44,593 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-23 06:35:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-23 06:35:44,594 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-07-23 06:35:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:44,594 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-23 06:35:44,595 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-23 06:35:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-23 06:35:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 06:35:44,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:44,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:35:44,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 06:35:44,612 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-23 06:35:44,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-07-23 06:35:44,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:44,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053303333] [2022-07-23 06:35:44,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:44,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:44,664 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-23 06:35:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:44,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053303333] [2022-07-23 06:35:44,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053303333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:44,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:44,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:35:44,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616108351] [2022-07-23 06:35:44,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:44,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:35:44,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:35:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:35:44,681 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-23 06:35:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:44,739 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-23 06:35:44,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:35:44,739 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-23 06:35:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:44,740 INFO L225 Difference]: With dead ends: 83 [2022-07-23 06:35:44,740 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 06:35:44,740 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-23 06:35:44,741 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-23 06:35:44,742 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-23 06:35:44,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 06:35:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-23 06:35:44,754 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-23 06:35:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-23 06:35:44,755 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-07-23 06:35:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:44,756 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-23 06:35:44,756 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-23 06:35:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-23 06:35:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:35:44,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:44,757 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:35:44,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 06:35:44,758 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-23 06:35:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-07-23 06:35:44,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:44,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878693180] [2022-07-23 06:35:44,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:44,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:44,882 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-23 06:35:44,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:44,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878693180] [2022-07-23 06:35:44,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878693180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:44,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:44,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:35:44,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691454435] [2022-07-23 06:35:44,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:44,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:35:44,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:44,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:35:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:35:44,884 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-23 06:35:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:45,023 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-07-23 06:35:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:35:45,023 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-23 06:35:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:45,028 INFO L225 Difference]: With dead ends: 97 [2022-07-23 06:35:45,028 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 06:35:45,028 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-23 06:35:45,035 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-23 06:35:45,037 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-23 06:35:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 06:35:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-23 06:35:45,045 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-23 06:35:45,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-23 06:35:45,045 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-07-23 06:35:45,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:45,046 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-23 06:35:45,046 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-23 06:35:45,046 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-23 06:35:45,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:35:45,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:45,047 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:35:45,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 06:35:45,047 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-23 06:35:45,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:45,048 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-07-23 06:35:45,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:45,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774134941] [2022-07-23 06:35:45,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:45,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:45,194 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-23 06:35:45,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:45,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774134941] [2022-07-23 06:35:45,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774134941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:45,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:45,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 06:35:45,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797052098] [2022-07-23 06:35:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:45,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:35:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:35:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:35:45,197 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-23 06:35:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:45,294 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-07-23 06:35:45,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:35:45,296 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-23 06:35:45,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:45,298 INFO L225 Difference]: With dead ends: 76 [2022-07-23 06:35:45,298 INFO L226 Difference]: Without dead ends: 76 [2022-07-23 06:35:45,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:35:45,301 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-23 06:35:45,301 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-23 06:35:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-23 06:35:45,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-07-23 06:35:45,311 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-23 06:35:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-07-23 06:35:45,312 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-07-23 06:35:45,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:45,312 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-07-23 06:35:45,312 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-23 06:35:45,313 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-07-23 06:35:45,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:35:45,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:45,313 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-23 06:35:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 06:35:45,314 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-23 06:35:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:45,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-07-23 06:35:45,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:45,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881751904] [2022-07-23 06:35:45,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:45,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:45,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:45,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:45,444 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-23 06:35:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:45,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881751904] [2022-07-23 06:35:45,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881751904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:45,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614164415] [2022-07-23 06:35:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:45,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:35:45,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:45,450 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-23 06:35:45,451 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-23 06:35:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:45,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 06:35:45,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:35:45,589 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-23 06:35:45,693 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-23 06:35:45,693 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-23 06:35:45,703 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-23 06:35:45,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:35:45,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614164415] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:45,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:35:45,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-23 06:35:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949695556] [2022-07-23 06:35:45,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:35:45,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:35:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:45,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:35:45,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:35:45,749 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-23 06:35:45,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:45,844 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-23 06:35:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:35:45,844 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-23 06:35:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:45,845 INFO L225 Difference]: With dead ends: 94 [2022-07-23 06:35:45,845 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 06:35:45,846 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-23 06:35:45,846 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-23 06:35:45,846 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-23 06:35:45,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 06:35:45,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-07-23 06:35:45,849 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-23 06:35:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-07-23 06:35:45,849 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-07-23 06:35:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:45,850 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-07-23 06:35:45,850 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-23 06:35:45,850 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-07-23 06:35:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:35:45,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:45,851 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-23 06:35:45,886 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-23 06:35:46,071 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-23 06:35:46,072 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-23 06:35:46,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-07-23 06:35:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:46,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386618675] [2022-07-23 06:35:46,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:46,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:46,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:46,289 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-23 06:35:46,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386618675] [2022-07-23 06:35:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386618675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1894287921] [2022-07-23 06:35:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:46,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:35:46,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:46,291 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-23 06:35:46,292 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-23 06:35:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:46,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-23 06:35:46,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:35:46,390 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-23 06:35:46,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:35:46,629 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-23 06:35:46,635 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:35:46,636 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-23 06:35:46,661 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-23 06:35:46,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:35:50,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1894287921] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:50,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:35:50,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-23 06:35:50,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716250624] [2022-07-23 06:35:50,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:35:50,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:35:50,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:50,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:35:50,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-23 06:35:50,816 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-23 06:35:51,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:51,031 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-23 06:35:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:35:51,035 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-23 06:35:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:51,035 INFO L225 Difference]: With dead ends: 94 [2022-07-23 06:35:51,035 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 06:35:51,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:35:51,036 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-23 06:35:51,036 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-23 06:35:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 06:35:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-07-23 06:35:51,038 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-23 06:35:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-07-23 06:35:51,039 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-07-23 06:35:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:51,039 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-07-23 06:35:51,039 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-23 06:35:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-07-23 06:35:51,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:35:51,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:51,040 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-23 06:35:51,076 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-23 06:35:51,251 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-23 06:35:51,252 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-23 06:35:51,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:51,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-07-23 06:35:51,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:51,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923181267] [2022-07-23 06:35:51,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:51,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:51,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:51,391 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-23 06:35:51,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:51,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923181267] [2022-07-23 06:35:51,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923181267] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:51,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:51,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:35:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408390582] [2022-07-23 06:35:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:51,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:35:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:35:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:35:51,395 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-23 06:35:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:51,615 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-23 06:35:51,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:35:51,615 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-23 06:35:51,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:51,616 INFO L225 Difference]: With dead ends: 142 [2022-07-23 06:35:51,616 INFO L226 Difference]: Without dead ends: 142 [2022-07-23 06:35:51,616 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-23 06:35:51,617 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-23 06:35:51,617 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-23 06:35:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-23 06:35:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-07-23 06:35:51,619 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-23 06:35:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-23 06:35:51,619 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-07-23 06:35:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:51,620 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-23 06:35:51,620 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-23 06:35:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-23 06:35:51,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:35:51,620 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:51,620 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-23 06:35:51,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 06:35:51,621 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-23 06:35:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-07-23 06:35:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:51,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983847403] [2022-07-23 06:35:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:51,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:51,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:51,751 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-23 06:35:51,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983847403] [2022-07-23 06:35:51,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983847403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:51,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:51,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:35:51,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689710950] [2022-07-23 06:35:51,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:51,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:35:51,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:51,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:35:51,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:35:51,753 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-23 06:35:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:51,967 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2022-07-23 06:35:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:35:51,967 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-23 06:35:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:51,968 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:35:51,968 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:35:51,968 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-23 06:35:51,969 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-23 06:35:51,969 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-23 06:35:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:35:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 76. [2022-07-23 06:35:51,971 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-23 06:35:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-07-23 06:35:51,971 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 30 [2022-07-23 06:35:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:51,971 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-07-23 06:35:51,972 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-23 06:35:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-07-23 06:35:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:35:51,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:51,972 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-23 06:35:51,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 06:35:51,972 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-23 06:35:51,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:51,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2022-07-23 06:35:51,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:51,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292944340] [2022-07-23 06:35:51,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:52,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,025 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-23 06:35:52,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:52,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292944340] [2022-07-23 06:35:52,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292944340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:52,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:52,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:35:52,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12197187] [2022-07-23 06:35:52,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:52,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:35:52,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:52,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:35:52,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:35:52,027 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-23 06:35:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:52,090 INFO L93 Difference]: Finished difference Result 155 states and 170 transitions. [2022-07-23 06:35:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:35:52,091 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-23 06:35:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:52,092 INFO L225 Difference]: With dead ends: 155 [2022-07-23 06:35:52,092 INFO L226 Difference]: Without dead ends: 155 [2022-07-23 06:35:52,092 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-23 06:35:52,093 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-23 06:35:52,093 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-23 06:35:52,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-23 06:35:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 78. [2022-07-23 06:35:52,095 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-23 06:35:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2022-07-23 06:35:52,095 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 32 [2022-07-23 06:35:52,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:52,096 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2022-07-23 06:35:52,096 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-23 06:35:52,096 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2022-07-23 06:35:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:35:52,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:52,097 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-23 06:35:52,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 06:35:52,097 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-23 06:35:52,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:52,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333233, now seen corresponding path program 1 times [2022-07-23 06:35:52,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:52,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722174610] [2022-07-23 06:35:52,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:52,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:52,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,181 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-23 06:35:52,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:52,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722174610] [2022-07-23 06:35:52,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722174610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:52,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:52,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:35:52,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796599689] [2022-07-23 06:35:52,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:52,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 06:35:52,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:52,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 06:35:52,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:35:52,183 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-23 06:35:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:52,408 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-07-23 06:35:52,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 06:35:52,409 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-23 06:35:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:52,409 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:35:52,409 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:35:52,409 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-23 06:35:52,410 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:35:52,410 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.2s Time] [2022-07-23 06:35:52,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:35:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 81. [2022-07-23 06:35:52,412 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-23 06:35:52,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-07-23 06:35:52,412 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 32 [2022-07-23 06:35:52,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:52,412 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-07-23 06:35:52,412 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-23 06:35:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-07-23 06:35:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:35:52,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:52,413 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-23 06:35:52,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 06:35:52,413 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-23 06:35:52,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333232, now seen corresponding path program 1 times [2022-07-23 06:35:52,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:52,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731789427] [2022-07-23 06:35:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:52,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,467 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-23 06:35:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731789427] [2022-07-23 06:35:52,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731789427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220836713] [2022-07-23 06:35:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:35:52,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:52,469 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-23 06:35:52,471 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-23 06:35:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:35:52,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:35:52,583 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-23 06:35:52,584 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:35:52,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220836713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:52,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 06:35:52,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2022-07-23 06:35:52,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105026241] [2022-07-23 06:35:52,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:52,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:35:52,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:52,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:35:52,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 06:35:52,585 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-23 06:35:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:52,599 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-07-23 06:35:52,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:35:52,599 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-23 06:35:52,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:52,600 INFO L225 Difference]: With dead ends: 103 [2022-07-23 06:35:52,600 INFO L226 Difference]: Without dead ends: 103 [2022-07-23 06:35:52,600 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-23 06:35:52,601 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-23 06:35:52,601 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-23 06:35:52,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-23 06:35:52,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 82. [2022-07-23 06:35:52,602 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-23 06:35:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-07-23 06:35:52,603 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 32 [2022-07-23 06:35:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:52,603 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-07-23 06:35:52,603 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-23 06:35:52,604 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-07-23 06:35:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:35:52,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:52,604 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-23 06:35:52,635 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-23 06:35:52,821 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-23 06:35:52,822 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-23 06:35:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:52,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-07-23 06:35:52,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:52,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897670031] [2022-07-23 06:35:52,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:52,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,862 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-23 06:35:52,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:52,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897670031] [2022-07-23 06:35:52,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897670031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:35:52,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:35:52,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:35:52,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255649868] [2022-07-23 06:35:52,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:35:52,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 06:35:52,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:52,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 06:35:52,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 06:35:52,864 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-23 06:35:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:52,908 INFO L93 Difference]: Finished difference Result 150 states and 168 transitions. [2022-07-23 06:35:52,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:35:52,909 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-23 06:35:52,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:52,910 INFO L225 Difference]: With dead ends: 150 [2022-07-23 06:35:52,910 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 06:35:52,910 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-23 06:35:52,910 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.0s IncrementalHoareTripleChecker+Time [2022-07-23 06:35:52,910 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.0s Time] [2022-07-23 06:35:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 06:35:52,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 83. [2022-07-23 06:35:52,912 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-23 06:35:52,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-07-23 06:35:52,913 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 33 [2022-07-23 06:35:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:52,913 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-07-23 06:35:52,913 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-23 06:35:52,913 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-07-23 06:35:52,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:35:52,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:52,914 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-23 06:35:52,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 06:35:52,914 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-23 06:35:52,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:52,914 INFO L85 PathProgramCache]: Analyzing trace with hash 274321452, now seen corresponding path program 1 times [2022-07-23 06:35:52,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:52,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130592644] [2022-07-23 06:35:52,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:52,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:52,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:52,992 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-23 06:35:52,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:52,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130592644] [2022-07-23 06:35:52,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130592644] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:52,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997214224] [2022-07-23 06:35:52,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:52,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:35:52,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:52,994 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-23 06:35:52,995 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-23 06:35:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:53,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:35:53,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:35:53,156 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-23 06:35:53,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:35:53,187 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-23 06:35:53,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997214224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:35:53,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:35:53,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-07-23 06:35:53,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895690882] [2022-07-23 06:35:53,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:35:53,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:35:53,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:53,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:35:53,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:35:53,190 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-23 06:35:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:35:53,262 INFO L93 Difference]: Finished difference Result 130 states and 148 transitions. [2022-07-23 06:35:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:35:53,262 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-23 06:35:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:35:53,263 INFO L225 Difference]: With dead ends: 130 [2022-07-23 06:35:53,263 INFO L226 Difference]: Without dead ends: 130 [2022-07-23 06:35:53,263 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-23 06:35:53,264 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-23 06:35:53,264 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-23 06:35:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-23 06:35:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 93. [2022-07-23 06:35:53,266 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-23 06:35:53,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 106 transitions. [2022-07-23 06:35:53,268 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 106 transitions. Word has length 37 [2022-07-23 06:35:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:35:53,269 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 106 transitions. [2022-07-23 06:35:53,269 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-23 06:35:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 106 transitions. [2022-07-23 06:35:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:35:53,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:35:53,271 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-23 06:35:53,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 06:35:53,487 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-23 06:35:53,488 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-23 06:35:53,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:35:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2022-07-23 06:35:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:35:53,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308479977] [2022-07-23 06:35:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:53,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:35:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:53,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:35:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:53,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:35:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:53,766 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-23 06:35:53,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:35:53,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308479977] [2022-07-23 06:35:53,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308479977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:53,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832751157] [2022-07-23 06:35:53,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:35:53,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:35:53,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:35:53,768 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-23 06:35:53,769 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-23 06:35:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:35:53,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-23 06:35:53,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:35:53,898 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-23 06:35:53,952 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:35:53,953 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-23 06:35:53,967 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-23 06:35:54,010 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:35:54,010 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-23 06:35:54,166 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:35:54,166 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-23 06:35:54,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:35:54,313 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:35:54,313 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-23 06:35:54,318 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-23 06:35:54,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:35:58,865 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-23 06:35:58,866 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-23 06:35:58,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (v_ArrVal_1038 (Array Int Int))) (or (< |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|) (= |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_1038) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)) (not (<= 0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)))) is different from false [2022-07-23 06:35:58,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10| Int) (v_ArrVal_1038 (Array Int Int))) (or (= (select (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_10|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (not (<= 0 |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_10|)) (< |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-23 06:35:58,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:35:58,907 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-23 06:35:58,924 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:35:58,924 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 30 treesize of output 30 [2022-07-23 06:35:58,928 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-23 06:35:59,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832751157] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:35:59,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:35:59,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 28 [2022-07-23 06:35:59,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737955180] [2022-07-23 06:35:59,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:35:59,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 06:35:59,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 06:35:59,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 06:35:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1241, Unknown=2, NotChecked=142, Total=1482 [2022-07-23 06:35:59,097 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-23 06:36:00,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:00,228 INFO L93 Difference]: Finished difference Result 221 states and 249 transitions. [2022-07-23 06:36:00,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:36:00,229 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-23 06:36:00,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:00,230 INFO L225 Difference]: With dead ends: 221 [2022-07-23 06:36:00,230 INFO L226 Difference]: Without dead ends: 221 [2022-07-23 06:36:00,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=315, Invalid=2141, Unknown=2, NotChecked=194, Total=2652 [2022-07-23 06:36:00,231 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 927 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 962 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:00,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 1187 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 962 Invalid, 0 Unknown, 110 Unchecked, 0.5s Time] [2022-07-23 06:36:00,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-23 06:36:00,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 117. [2022-07-23 06:36:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 112 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-23 06:36:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2022-07-23 06:36:00,234 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 38 [2022-07-23 06:36:00,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:00,235 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2022-07-23 06:36:00,235 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-23 06:36:00,235 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-07-23 06:36:00,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:36:00,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:00,235 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-23 06:36:00,253 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-23 06:36:00,453 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-23 06:36:00,454 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-23 06:36:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2022-07-23 06:36:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 06:36:00,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138966974] [2022-07-23 06:36:00,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 06:36:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:00,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 06:36:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:00,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 06:36:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:00,834 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-23 06:36:00,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 06:36:00,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138966974] [2022-07-23 06:36:00,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138966974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:00,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787713406] [2022-07-23 06:36:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:00,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 06:36:00,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:36:00,836 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-23 06:36:00,859 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-23 06:36:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:00,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-23 06:36:00,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:00,984 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-23 06:36:01,265 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:01,265 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-23 06:36:01,271 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-23 06:36:01,291 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-23 06:36:01,471 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-23 06:36:01,472 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 127651 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-23 06:36:01,475 INFO L158 Benchmark]: Toolchain (without parser) took 18415.80ms. Allocated memory was 104.9MB in the beginning and 184.5MB in the end (delta: 79.7MB). Free memory was 75.0MB in the beginning and 142.0MB in the end (delta: -66.9MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2022-07-23 06:36:01,475 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:36:01,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.22ms. Allocated memory was 104.9MB in the beginning and 153.1MB in the end (delta: 48.2MB). Free memory was 74.7MB in the beginning and 118.8MB in the end (delta: -44.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-23 06:36:01,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.77ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:36:01,475 INFO L158 Benchmark]: Boogie Preprocessor took 29.23ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 115.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 06:36:01,475 INFO L158 Benchmark]: RCFGBuilder took 522.88ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 98.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-23 06:36:01,476 INFO L158 Benchmark]: TraceAbstraction took 17410.12ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 97.9MB in the beginning and 142.0MB in the end (delta: -44.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 06:36:01,476 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 61.9MB in the beginning and 61.8MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.22ms. Allocated memory was 104.9MB in the beginning and 153.1MB in the end (delta: 48.2MB). Free memory was 74.7MB in the beginning and 118.8MB in the end (delta: -44.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.77ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.23ms. Allocated memory is still 153.1MB. Free memory was 116.7MB in the beginning and 115.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.88ms. Allocated memory is still 153.1MB. Free memory was 115.1MB in the beginning and 98.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17410.12ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 97.9MB in the beginning and 142.0MB in the end (delta: -44.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 127651 column 46: unknown constant v_#length_BEFORE_CALL_4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 127651 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-23 06:36:01,495 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-?-791161d [2022-07-23 06:36:03,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 06:36:03,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 06:36:03,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 06:36:03,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 06:36:03,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 06:36:03,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 06:36:03,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 06:36:03,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 06:36:03,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 06:36:03,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 06:36:03,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 06:36:03,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 06:36:03,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 06:36:03,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 06:36:03,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 06:36:03,293 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 06:36:03,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 06:36:03,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 06:36:03,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 06:36:03,302 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 06:36:03,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 06:36:03,304 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 06:36:03,305 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 06:36:03,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 06:36:03,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 06:36:03,314 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 06:36:03,314 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 06:36:03,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 06:36:03,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 06:36:03,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 06:36:03,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 06:36:03,317 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 06:36:03,318 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 06:36:03,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 06:36:03,320 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 06:36:03,320 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 06:36:03,320 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 06:36:03,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 06:36:03,321 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 06:36:03,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 06:36:03,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 06:36:03,323 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-23 06:36:03,349 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 06:36:03,350 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 06:36:03,350 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 06:36:03,350 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 06:36:03,351 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 06:36:03,351 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 06:36:03,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 06:36:03,351 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 06:36:03,351 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 06:36:03,352 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 06:36:03,352 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 06:36:03,353 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 06:36:03,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 06:36:03,353 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 06:36:03,353 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 06:36:03,353 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 06:36:03,353 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 06:36:03,353 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 06:36:03,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 06:36:03,354 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 06:36:03,354 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 06:36:03,354 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 06:36:03,354 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 06:36:03,354 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 06:36:03,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 06:36:03,355 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 06:36:03,355 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 06:36:03,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:36:03,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 06:36:03,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 06:36:03,355 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 06:36:03,356 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 06:36:03,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 06:36:03,356 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-23 06:36:03,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 06:36:03,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 06:36:03,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 06:36:03,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 06:36:03,715 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 06:36:03,716 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-23 06:36:03,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42da8d840/05f6095064d74112b6ce9487e81652e5/FLAG15066256c [2022-07-23 06:36:04,249 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 06:36:04,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all.i [2022-07-23 06:36:04,261 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42da8d840/05f6095064d74112b6ce9487e81652e5/FLAG15066256c [2022-07-23 06:36:04,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42da8d840/05f6095064d74112b6ce9487e81652e5 [2022-07-23 06:36:04,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 06:36:04,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 06:36:04,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 06:36:04,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 06:36:04,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 06:36:04,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11bef514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04, skipping insertion in model container [2022-07-23 06:36:04,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 06:36:04,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 06:36:04,565 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-23 06:36:04,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:36:04,584 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 06:36:04,619 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-23 06:36:04,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 06:36:04,640 INFO L208 MainTranslator]: Completed translation [2022-07-23 06:36:04,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04 WrapperNode [2022-07-23 06:36:04,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 06:36:04,642 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 06:36:04,642 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 06:36:04,642 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 06:36:04,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,702 INFO L137 Inliner]: procedures = 129, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-07-23 06:36:04,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 06:36:04,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 06:36:04,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 06:36:04,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 06:36:04,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,721 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,750 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 06:36:04,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 06:36:04,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 06:36:04,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 06:36:04,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (1/1) ... [2022-07-23 06:36:04,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 06:36:04,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 06:36:04,821 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-23 06:36:04,861 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-23 06:36:04,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-23 06:36:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-23 06:36:04,885 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-23 06:36:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 06:36:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 06:36:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 06:36:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 06:36:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 06:36:04,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-23 06:36:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 06:36:04,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 06:36:04,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 06:36:04,966 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 06:36:04,967 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 06:36:05,246 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 06:36:05,251 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 06:36:05,251 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-23 06:36:05,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:36:05 BoogieIcfgContainer [2022-07-23 06:36:05,252 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 06:36:05,253 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 06:36:05,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 06:36:05,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 06:36:05,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 06:36:04" (1/3) ... [2022-07-23 06:36:05,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:36:05, skipping insertion in model container [2022-07-23 06:36:05,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 06:36:04" (2/3) ... [2022-07-23 06:36:05,261 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@876f65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 06:36:05, skipping insertion in model container [2022-07-23 06:36:05,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 06:36:05" (3/3) ... [2022-07-23 06:36:05,262 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all.i [2022-07-23 06:36:05,272 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 06:36:05,272 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-23 06:36:05,303 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 06:36:05,308 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@66940835, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@220023b8 [2022-07-23 06:36:05,308 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-23 06:36:05,320 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-23 06:36:05,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:36:05,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:05,327 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:36:05,327 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-23 06:36:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:05,331 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-07-23 06:36:05,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:05,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191407357] [2022-07-23 06:36:05,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:05,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:05,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:05,388 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-23 06:36:05,415 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-23 06:36:05,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:05,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:36:05,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:05,556 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-23 06:36:05,568 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-23 06:36:05,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:05,569 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:05,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191407357] [2022-07-23 06:36:05,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191407357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:05,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:05,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:36:05,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380902661] [2022-07-23 06:36:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:36:05,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:05,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:36:05,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:36:05,601 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-23 06:36:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:05,694 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-23 06:36:05,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:36:05,696 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-23 06:36:05,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:05,701 INFO L225 Difference]: With dead ends: 81 [2022-07-23 06:36:05,702 INFO L226 Difference]: Without dead ends: 78 [2022-07-23 06:36:05,703 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-23 06:36:05,705 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-23 06:36:05,707 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-23 06:36:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-23 06:36:05,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-23 06:36:05,735 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-23 06:36:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-23 06:36:05,737 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-07-23 06:36:05,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:05,737 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-23 06:36:05,738 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-23 06:36:05,738 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-23 06:36:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 06:36:05,738 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:05,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 06:36:05,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-23 06:36:05,944 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-23 06:36:05,946 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-23 06:36:05,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:05,946 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-07-23 06:36:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:05,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100528436] [2022-07-23 06:36:05,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:05,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:05,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:05,950 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-23 06:36:05,960 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-23 06:36:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:06,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:36:06,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:06,056 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-23 06:36:06,085 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-23 06:36:06,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:06,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:06,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100528436] [2022-07-23 06:36:06,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100528436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:06,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:06,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 06:36:06,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591085338] [2022-07-23 06:36:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:06,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:36:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:06,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:36:06,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:36:06,088 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-23 06:36:06,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:06,180 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-23 06:36:06,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:36:06,181 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-23 06:36:06,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:06,182 INFO L225 Difference]: With dead ends: 76 [2022-07-23 06:36:06,182 INFO L226 Difference]: Without dead ends: 76 [2022-07-23 06:36:06,182 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-23 06:36:06,183 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-23 06:36:06,183 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-23 06:36:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-23 06:36:06,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-23 06:36:06,187 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-23 06:36:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-23 06:36:06,188 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-07-23 06:36:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:06,188 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-23 06:36:06,189 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-23 06:36:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-23 06:36:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-23 06:36:06,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:06,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:36:06,210 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-23 06:36:06,389 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-23 06:36:06,390 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-23 06:36:06,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:06,390 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-07-23 06:36:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:06,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878667068] [2022-07-23 06:36:06,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:06,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:06,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:06,396 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-23 06:36:06,403 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-23 06:36:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:06,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:36:06,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:06,475 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-23 06:36:06,476 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:06,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:06,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878667068] [2022-07-23 06:36:06,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878667068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:06,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:06,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 06:36:06,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313932516] [2022-07-23 06:36:06,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:06,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 06:36:06,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:06,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 06:36:06,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 06:36:06,478 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-23 06:36:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:06,498 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-23 06:36:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 06:36:06,498 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-23 06:36:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:06,499 INFO L225 Difference]: With dead ends: 83 [2022-07-23 06:36:06,499 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 06:36:06,500 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-23 06:36:06,500 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-23 06:36:06,501 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-23 06:36:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 06:36:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-23 06:36:06,506 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-23 06:36:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-23 06:36:06,507 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-07-23 06:36:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:06,507 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-23 06:36:06,507 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-23 06:36:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-23 06:36:06,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:36:06,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:06,508 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:36:06,517 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-23 06:36:06,715 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-23 06:36:06,717 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-23 06:36:06,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:06,719 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-07-23 06:36:06,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:06,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829455207] [2022-07-23 06:36:06,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:06,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:06,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:06,723 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-23 06:36:06,725 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-23 06:36:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:06,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:36:06,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:06,817 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-23 06:36:06,861 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-23 06:36:06,861 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:06,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:06,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829455207] [2022-07-23 06:36:06,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829455207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:06,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:06,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:36:06,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032665355] [2022-07-23 06:36:06,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:06,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:36:06,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:06,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:36:06,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:36:06,864 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-23 06:36:07,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:07,051 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-07-23 06:36:07,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:36:07,052 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-23 06:36:07,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:07,053 INFO L225 Difference]: With dead ends: 97 [2022-07-23 06:36:07,053 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 06:36:07,054 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-23 06:36:07,054 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-23 06:36:07,055 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-23 06:36:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 06:36:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-23 06:36:07,058 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-23 06:36:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-23 06:36:07,065 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-07-23 06:36:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:07,065 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-23 06:36:07,065 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-23 06:36:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-23 06:36:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-23 06:36:07,066 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:07,066 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:36:07,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-23 06:36:07,273 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-23 06:36:07,273 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-23 06:36:07,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:07,274 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-07-23 06:36:07,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:07,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681729464] [2022-07-23 06:36:07,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:07,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:07,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:07,276 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-23 06:36:07,277 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-23 06:36:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:07,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:36:07,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:07,369 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-23 06:36:07,421 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-23 06:36:07,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:07,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:07,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681729464] [2022-07-23 06:36:07,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681729464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:07,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:07,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 06:36:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051314155] [2022-07-23 06:36:07,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:07,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:36:07,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:36:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:36:07,423 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-23 06:36:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:07,589 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-07-23 06:36:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:36:07,590 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-23 06:36:07,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:07,590 INFO L225 Difference]: With dead ends: 76 [2022-07-23 06:36:07,591 INFO L226 Difference]: Without dead ends: 76 [2022-07-23 06:36:07,591 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-23 06:36:07,591 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.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:07,592 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.1s Time] [2022-07-23 06:36:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-23 06:36:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-07-23 06:36:07,595 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-23 06:36:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-07-23 06:36:07,596 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-07-23 06:36:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:07,596 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-07-23 06:36:07,596 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-23 06:36:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-07-23 06:36:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:36:07,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:07,597 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-23 06:36:07,604 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-23 06:36:07,804 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-23 06:36:07,804 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-23 06:36:07,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-07-23 06:36:07,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:07,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [623302313] [2022-07-23 06:36:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:07,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:07,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:07,806 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-23 06:36:07,808 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-23 06:36:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:07,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:36:07,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:07,898 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-23 06:36:08,035 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:36:08,036 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-23 06:36:08,049 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-23 06:36:08,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:08,237 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-23 06:36:08,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:08,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [623302313] [2022-07-23 06:36:08,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [623302313] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:36:08,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:08,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-23 06:36:08,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913219802] [2022-07-23 06:36:08,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:08,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:36:08,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:08,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:36:08,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:36:08,240 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-23 06:36:08,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:08,440 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-07-23 06:36:08,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:36:08,441 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-23 06:36:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:08,442 INFO L225 Difference]: With dead ends: 101 [2022-07-23 06:36:08,442 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 06:36:08,442 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-23 06:36:08,443 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:08,443 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.2s Time] [2022-07-23 06:36:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 06:36:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2022-07-23 06:36:08,447 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-23 06:36:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-07-23 06:36:08,448 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 25 [2022-07-23 06:36:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:08,448 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-07-23 06:36:08,448 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-23 06:36:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-07-23 06:36:08,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 06:36:08,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:08,449 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-23 06:36:08,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-23 06:36:08,656 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-23 06:36:08,657 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-23 06:36:08,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:08,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-07-23 06:36:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:08,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [381003952] [2022-07-23 06:36:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:08,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:08,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:08,660 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-23 06:36:08,661 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-23 06:36:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:08,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:36:08,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:08,760 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-23 06:36:08,764 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-23 06:36:08,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:08,938 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-23 06:36:08,945 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:08,945 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-23 06:36:08,976 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-23 06:36:08,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:11,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [381003952] [2022-07-23 06:36:11,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [381003952] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [710302818] [2022-07-23 06:36:11,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:11,257 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:36:11,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:36:11,259 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-23 06:36:11,260 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-23 06:36:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:11,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:36:11,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:11,418 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-23 06:36:11,424 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-23 06:36:11,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:11,549 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-23 06:36:11,557 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:11,557 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-23 06:36:11,573 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-23 06:36:11,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:11,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [710302818] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:11,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:11,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-23 06:36:11,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869633876] [2022-07-23 06:36:11,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:11,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:36:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:11,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:36:11,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 06:36:11,717 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-23 06:36:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:11,979 INFO L93 Difference]: Finished difference Result 163 states and 177 transitions. [2022-07-23 06:36:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:36:11,980 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-23 06:36:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:11,980 INFO L225 Difference]: With dead ends: 163 [2022-07-23 06:36:11,980 INFO L226 Difference]: Without dead ends: 163 [2022-07-23 06:36:11,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:36:11,981 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.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:11,981 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.2s Time] [2022-07-23 06:36:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-23 06:36:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 87. [2022-07-23 06:36:11,985 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-23 06:36:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-23 06:36:11,986 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 25 [2022-07-23 06:36:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:11,986 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-23 06:36:11,986 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-23 06:36:11,986 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-23 06:36:11,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:36:11,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:11,987 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-23 06:36:11,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-07-23 06:36:12,197 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-23 06:36:12,390 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-23 06:36:12,390 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-23 06:36:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:12,391 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-07-23 06:36:12,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:12,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1940039123] [2022-07-23 06:36:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:12,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:12,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:12,392 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-23 06:36:12,393 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-23 06:36:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:12,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:36:12,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:12,489 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-23 06:36:12,549 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-23 06:36:12,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:12,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:12,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1940039123] [2022-07-23 06:36:12,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1940039123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:12,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:12,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:36:12,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831306369] [2022-07-23 06:36:12,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:12,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:36:12,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:12,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:36:12,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:36:12,550 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-23 06:36:12,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:12,946 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2022-07-23 06:36:12,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:36:12,946 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-23 06:36:12,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:12,947 INFO L225 Difference]: With dead ends: 155 [2022-07-23 06:36:12,947 INFO L226 Difference]: Without dead ends: 155 [2022-07-23 06:36:12,947 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-23 06:36:12,948 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 313 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:12,948 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.3s Time] [2022-07-23 06:36:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-23 06:36:12,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 90. [2022-07-23 06:36:12,951 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-23 06:36:12,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-07-23 06:36:12,952 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 30 [2022-07-23 06:36:12,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:12,952 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-07-23 06:36:12,953 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-23 06:36:12,953 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-07-23 06:36:12,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-23 06:36:12,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:12,954 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-23 06:36:12,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 06:36:13,161 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-23 06:36:13,161 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-23 06:36:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-07-23 06:36:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:13,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74149074] [2022-07-23 06:36:13,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:13,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:13,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:13,165 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-23 06:36:13,167 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-23 06:36:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:13,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:36:13,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:13,265 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-23 06:36:13,379 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-23 06:36:13,379 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:13,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:13,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74149074] [2022-07-23 06:36:13,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74149074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:13,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:13,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:36:13,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802081238] [2022-07-23 06:36:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:13,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:36:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:13,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:36:13,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:36:13,380 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-23 06:36:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:13,784 INFO L93 Difference]: Finished difference Result 136 states and 149 transitions. [2022-07-23 06:36:13,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:36:13,785 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-23 06:36:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:13,786 INFO L225 Difference]: With dead ends: 136 [2022-07-23 06:36:13,786 INFO L226 Difference]: Without dead ends: 136 [2022-07-23 06:36:13,786 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-23 06:36:13,787 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:13,787 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.3s Time] [2022-07-23 06:36:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-23 06:36:13,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 90. [2022-07-23 06:36:13,789 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-23 06:36:13,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2022-07-23 06:36:13,790 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 30 [2022-07-23 06:36:13,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:13,790 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2022-07-23 06:36:13,790 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-23 06:36:13,790 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2022-07-23 06:36:13,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-23 06:36:13,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:13,791 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-23 06:36:13,801 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-23 06:36:13,991 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-23 06:36:13,992 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-23 06:36:13,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:13,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1587333178, now seen corresponding path program 1 times [2022-07-23 06:36:13,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:13,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302452208] [2022-07-23 06:36:13,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:13,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:13,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:14,008 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-23 06:36:14,028 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-23 06:36:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:14,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 06:36:14,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:14,167 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-23 06:36:14,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:14,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:14,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302452208] [2022-07-23 06:36:14,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302452208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:14,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:14,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:36:14,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518154733] [2022-07-23 06:36:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:14,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:36:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:14,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:36:14,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:36:14,169 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-23 06:36:14,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:14,188 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-07-23 06:36:14,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:36:14,189 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-23 06:36:14,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:14,189 INFO L225 Difference]: With dead ends: 119 [2022-07-23 06:36:14,189 INFO L226 Difference]: Without dead ends: 119 [2022-07-23 06:36:14,190 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-23 06:36:14,190 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-23 06:36:14,191 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-23 06:36:14,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-23 06:36:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2022-07-23 06:36:14,202 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-23 06:36:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-07-23 06:36:14,203 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 32 [2022-07-23 06:36:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:14,203 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-07-23 06:36:14,203 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-23 06:36:14,203 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-07-23 06:36:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-23 06:36:14,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:14,205 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-23 06:36:14,214 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-23 06:36:14,412 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-23 06:36:14,413 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-23 06:36:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-07-23 06:36:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:14,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965183241] [2022-07-23 06:36:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:14,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:14,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:14,415 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-23 06:36:14,416 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-23 06:36:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:14,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:36:14,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:14,524 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-23 06:36:14,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:14,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:14,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965183241] [2022-07-23 06:36:14,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965183241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:14,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:14,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:36:14,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159566600] [2022-07-23 06:36:14,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:14,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:36:14,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:14,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:36:14,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:36:14,527 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-23 06:36:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:14,557 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-07-23 06:36:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:36:14,558 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-23 06:36:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:14,559 INFO L225 Difference]: With dead ends: 168 [2022-07-23 06:36:14,559 INFO L226 Difference]: Without dead ends: 168 [2022-07-23 06:36:14,559 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-23 06:36:14,560 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-23 06:36:14,560 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-23 06:36:14,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-23 06:36:14,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 93. [2022-07-23 06:36:14,562 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-23 06:36:14,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2022-07-23 06:36:14,563 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 33 [2022-07-23 06:36:14,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:14,563 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2022-07-23 06:36:14,563 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-23 06:36:14,563 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-07-23 06:36:14,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:36:14,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:14,564 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-23 06:36:14,573 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-23 06:36:14,764 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-23 06:36:14,764 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-23 06:36:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:14,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1813078092, now seen corresponding path program 2 times [2022-07-23 06:36:14,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:14,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [37293465] [2022-07-23 06:36:14,765 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:36:14,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:14,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:14,772 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-23 06:36:14,814 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-23 06:36:14,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:36:14,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:36:14,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:36:14,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:14,940 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-23 06:36:14,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:14,985 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-23 06:36:14,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:14,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [37293465] [2022-07-23 06:36:14,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [37293465] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:36:14,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:14,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-23 06:36:14,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610326963] [2022-07-23 06:36:14,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:14,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 06:36:14,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:14,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 06:36:14,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-23 06:36:14,987 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-23 06:36:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:14,998 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2022-07-23 06:36:14,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 06:36:14,999 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-23 06:36:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:14,999 INFO L225 Difference]: With dead ends: 86 [2022-07-23 06:36:14,999 INFO L226 Difference]: Without dead ends: 86 [2022-07-23 06:36:15,000 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-23 06:36:15,006 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-23 06:36:15,006 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-23 06:36:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-23 06:36:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-23 06:36:15,008 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-23 06:36:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-23 06:36:15,009 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 37 [2022-07-23 06:36:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:15,009 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-23 06:36:15,009 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-23 06:36:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-23 06:36:15,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-23 06:36:15,010 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:15,010 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-23 06:36:15,018 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-23 06:36:15,217 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-23 06:36:15,218 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-23 06:36:15,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:15,218 INFO L85 PathProgramCache]: Analyzing trace with hash 274321506, now seen corresponding path program 1 times [2022-07-23 06:36:15,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:15,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392713994] [2022-07-23 06:36:15,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:15,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:15,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:15,220 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-23 06:36:15,222 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-23 06:36:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:15,322 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:36:15,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:15,375 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-23 06:36:15,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:15,420 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-23 06:36:15,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:15,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392713994] [2022-07-23 06:36:15,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392713994] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:36:15,420 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:15,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 06:36:15,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169376948] [2022-07-23 06:36:15,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:15,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:36:15,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:36:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:36:15,422 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-23 06:36:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:15,465 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-23 06:36:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:36:15,465 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-23 06:36:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:15,466 INFO L225 Difference]: With dead ends: 132 [2022-07-23 06:36:15,466 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 06:36:15,466 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-23 06:36:15,466 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-23 06:36:15,467 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-23 06:36:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 06:36:15,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2022-07-23 06:36:15,468 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-23 06:36:15,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-07-23 06:36:15,469 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 37 [2022-07-23 06:36:15,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:15,469 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-07-23 06:36:15,469 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-23 06:36:15,469 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-07-23 06:36:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:36:15,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:15,469 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-23 06:36:15,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 06:36:15,670 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-23 06:36:15,670 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-23 06:36:15,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash -46108703, now seen corresponding path program 1 times [2022-07-23 06:36:15,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:15,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728113897] [2022-07-23 06:36:15,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:15,671 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:15,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:15,673 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-23 06:36:15,674 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-23 06:36:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:15,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 06:36:15,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:15,828 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-23 06:36:15,913 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:15,913 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-23 06:36:15,955 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-23 06:36:16,013 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:16,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 28 treesize of output 29 [2022-07-23 06:36:16,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:16,140 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-23 06:36:16,188 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-23 06:36:16,227 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-23 06:36:16,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:18,464 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-23 06:36:18,465 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-23 06:36:18,471 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-23 06:36:18,482 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-23 06:36:18,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:18,493 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-23 06:36:18,497 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-23 06:36:18,500 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-23 06:36:18,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:18,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728113897] [2022-07-23 06:36:18,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728113897] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:18,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980719760] [2022-07-23 06:36:18,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:18,710 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:36:18,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:36:18,712 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-23 06:36:18,713 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-23 06:36:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:18,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-23 06:36:18,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:18,917 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-23 06:36:19,124 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:36:19,125 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-23 06:36:19,272 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-23 06:36:19,441 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:19,442 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-23 06:36:19,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:19,721 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-23 06:36:19,837 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-23 06:36:19,992 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-23 06:36:19,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:22,131 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-23 06:36:22,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:22,256 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-23 06:36:22,260 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-23 06:36:22,265 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-23 06:36:26,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [980719760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:26,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:26,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 32 [2022-07-23 06:36:26,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716823245] [2022-07-23 06:36:26,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:26,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 06:36:26,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:26,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 06:36:26,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1833, Unknown=7, NotChecked=264, Total=2256 [2022-07-23 06:36:26,015 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-23 06:36:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:28,276 INFO L93 Difference]: Finished difference Result 211 states and 236 transitions. [2022-07-23 06:36:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 06:36:28,276 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-23 06:36:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:28,278 INFO L225 Difference]: With dead ends: 211 [2022-07-23 06:36:28,278 INFO L226 Difference]: Without dead ends: 211 [2022-07-23 06:36:28,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=316, Invalid=2551, Unknown=7, NotChecked=318, Total=3192 [2022-07-23 06:36:28,279 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 514 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:28,279 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.3s Time] [2022-07-23 06:36:28,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-23 06:36:28,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 109. [2022-07-23 06:36:28,282 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-23 06:36:28,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-07-23 06:36:28,282 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 38 [2022-07-23 06:36:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:28,282 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-07-23 06:36:28,283 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-23 06:36:28,283 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-07-23 06:36:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 06:36:28,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:28,283 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-23 06:36:28,286 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-23 06:36:28,494 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-23 06:36:28,686 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-23 06:36:28,686 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-23 06:36:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash -46108702, now seen corresponding path program 1 times [2022-07-23 06:36:28,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:28,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888345637] [2022-07-23 06:36:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:28,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:28,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:28,689 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-23 06:36:28,690 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-23 06:36:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:28,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 06:36:28,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:28,862 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-23 06:36:28,870 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-23 06:36:29,138 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:29,138 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-23 06:36:29,149 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-23 06:36:29,258 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-23 06:36:29,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, 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-23 06:36:29,423 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:29,423 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-23 06:36:29,429 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-23 06:36:29,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:29,665 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-23 06:36:29,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:29,677 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-23 06:36:29,775 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-23 06:36:29,780 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-23 06:36:29,900 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-23 06:36:29,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:31,238 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-23 06:36:31,280 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-23 06:36:31,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:31,298 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-23 06:36:31,302 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-23 06:36:31,308 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-23 06:36:31,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:31,331 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-23 06:36:31,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:31,355 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-23 06:36:31,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:36:31,362 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-23 06:36:31,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:36:31,378 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-23 06:36:36,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:36,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888345637] [2022-07-23 06:36:36,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888345637] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:36,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [300835162] [2022-07-23 06:36:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:36,055 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:36:36,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:36:36,056 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-23 06:36:36,058 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-23 06:36:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:36,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-23 06:36:36,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:36,312 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-23 06:36:36,325 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-23 06:36:36,501 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:36:36,501 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-23 06:36:36,522 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:36,523 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-23 06:36:36,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, 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-23 06:36:36,590 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-23 06:36:36,646 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:36,647 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-23 06:36:36,652 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-23 06:36:36,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:36,731 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-23 06:36:36,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:36,745 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-23 06:36:36,797 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-23 06:36:36,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 25 treesize of output 13 [2022-07-23 06:36:36,816 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-23 06:36:36,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:37,743 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-23 06:36:37,785 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-23 06:36:37,804 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:37,805 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-23 06:36:37,809 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-23 06:36:37,815 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-23 06:36:37,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:37,843 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-23 06:36:37,856 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:37,856 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-23 06:36:37,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:36:37,864 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-23 06:36:37,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:36:37,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-23 06:36:38,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [300835162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:38,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:38,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2022-07-23 06:36:38,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558365812] [2022-07-23 06:36:38,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:38,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 06:36:38,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:38,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 06:36:38,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=800, Unknown=4, NotChecked=236, Total=1122 [2022-07-23 06:36:38,197 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-23 06:36:40,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:40,418 INFO L93 Difference]: Finished difference Result 237 states and 275 transitions. [2022-07-23 06:36:40,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 06:36:40,419 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-23 06:36:40,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:40,420 INFO L225 Difference]: With dead ends: 237 [2022-07-23 06:36:40,420 INFO L226 Difference]: Without dead ends: 237 [2022-07-23 06:36:40,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=175, Invalid=1319, Unknown=4, NotChecked=308, Total=1806 [2022-07-23 06:36:40,421 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 621 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:40,421 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.3s Time] [2022-07-23 06:36:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-23 06:36:40,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 117. [2022-07-23 06:36:40,424 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-23 06:36:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2022-07-23 06:36:40,424 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 38 [2022-07-23 06:36:40,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:40,424 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2022-07-23 06:36:40,424 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-23 06:36:40,425 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-07-23 06:36:40,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-23 06:36:40,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:40,425 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-23 06:36:40,431 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-23 06:36:40,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 06:36:40,829 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-23 06:36:40,829 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-23 06:36:40,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash 766820837, now seen corresponding path program 2 times [2022-07-23 06:36:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:40,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373492085] [2022-07-23 06:36:40,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:36:40,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:40,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:40,832 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-23 06:36:40,835 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-23 06:36:40,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:36:40,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:36:40,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 06:36:40,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:41,077 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-23 06:36:41,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:41,177 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-23 06:36:41,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:41,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373492085] [2022-07-23 06:36:41,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373492085] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:36:41,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:41,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-07-23 06:36:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663966378] [2022-07-23 06:36:41,178 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:41,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:36:41,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:41,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:36:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:36:41,179 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-23 06:36:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:41,297 INFO L93 Difference]: Finished difference Result 159 states and 182 transitions. [2022-07-23 06:36:41,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 06:36:41,298 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-23 06:36:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:41,299 INFO L225 Difference]: With dead ends: 159 [2022-07-23 06:36:41,299 INFO L226 Difference]: Without dead ends: 159 [2022-07-23 06:36:41,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-23 06:36:41,299 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-23 06:36:41,299 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-23 06:36:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-23 06:36:41,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 103. [2022-07-23 06:36:41,302 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-23 06:36:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2022-07-23 06:36:41,302 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 41 [2022-07-23 06:36:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:41,302 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2022-07-23 06:36:41,302 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-23 06:36:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2022-07-23 06:36:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:36:41,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:41,303 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-23 06:36:41,311 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-23 06:36:41,503 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-23 06:36:41,504 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-23 06:36:41,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash -168412858, now seen corresponding path program 2 times [2022-07-23 06:36:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:41,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817937617] [2022-07-23 06:36:41,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:36:41,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:41,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:41,506 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-23 06:36:41,508 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-23 06:36:41,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 06:36:41,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:36:41,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 06:36:41,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:41,613 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-23 06:36:41,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:41,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:41,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817937617] [2022-07-23 06:36:41,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817937617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:41,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:41,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 06:36:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489808679] [2022-07-23 06:36:41,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:41,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 06:36:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 06:36:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 06:36:41,614 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-23 06:36:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:41,648 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-07-23 06:36:41,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 06:36:41,648 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-23 06:36:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:41,649 INFO L225 Difference]: With dead ends: 105 [2022-07-23 06:36:41,649 INFO L226 Difference]: Without dead ends: 105 [2022-07-23 06:36:41,649 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-23 06:36:41,650 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-23 06:36:41,650 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-23 06:36:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-23 06:36:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 101. [2022-07-23 06:36:41,651 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-23 06:36:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-07-23 06:36:41,652 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 42 [2022-07-23 06:36:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:41,652 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-07-23 06:36:41,652 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-23 06:36:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-07-23 06:36:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-23 06:36:41,652 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:41,652 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-23 06:36:41,666 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-23 06:36:41,858 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-23 06:36:41,859 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-23 06:36:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash -168412913, now seen corresponding path program 1 times [2022-07-23 06:36:41,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554025128] [2022-07-23 06:36:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:41,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:41,861 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-23 06:36:41,862 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-23 06:36:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:41,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:36:41,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:42,015 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-23 06:36:42,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:42,061 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-23 06:36:42,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:42,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554025128] [2022-07-23 06:36:42,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554025128] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:36:42,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:42,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-23 06:36:42,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590803958] [2022-07-23 06:36:42,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:42,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 06:36:42,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:42,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 06:36:42,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-23 06:36:42,063 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-23 06:36:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:42,184 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-23 06:36:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 06:36:42,184 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-23 06:36:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:42,185 INFO L225 Difference]: With dead ends: 146 [2022-07-23 06:36:42,185 INFO L226 Difference]: Without dead ends: 146 [2022-07-23 06:36:42,185 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-23 06:36:42,186 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-23 06:36:42,186 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-23 06:36:42,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-23 06:36:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 97. [2022-07-23 06:36:42,193 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-23 06:36:42,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2022-07-23 06:36:42,193 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 42 [2022-07-23 06:36:42,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:42,193 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2022-07-23 06:36:42,194 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-23 06:36:42,194 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2022-07-23 06:36:42,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:36:42,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:42,194 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-23 06:36:42,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-23 06:36:42,395 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-23 06:36:42,395 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-23 06:36:42,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:42,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923923, now seen corresponding path program 1 times [2022-07-23 06:36:42,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:42,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727529386] [2022-07-23 06:36:42,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:42,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:42,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:42,405 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-23 06:36:42,406 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-23 06:36:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:42,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:36:42,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:42,563 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-23 06:36:42,661 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-23 06:36:42,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:42,661 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:42,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727529386] [2022-07-23 06:36:42,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727529386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:42,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:42,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:36:42,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079420728] [2022-07-23 06:36:42,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:42,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:36:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:42,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:36:42,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:36:42,663 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-23 06:36:43,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:43,125 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-07-23 06:36:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:36:43,125 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-23 06:36:43,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:43,126 INFO L225 Difference]: With dead ends: 122 [2022-07-23 06:36:43,126 INFO L226 Difference]: Without dead ends: 122 [2022-07-23 06:36:43,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 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-23 06:36:43,127 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 273 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:43,127 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.4s Time] [2022-07-23 06:36:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-23 06:36:43,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2022-07-23 06:36:43,128 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-23 06:36:43,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 109 transitions. [2022-07-23 06:36:43,129 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 109 transitions. Word has length 45 [2022-07-23 06:36:43,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:43,129 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 109 transitions. [2022-07-23 06:36:43,129 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-23 06:36:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 109 transitions. [2022-07-23 06:36:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 06:36:43,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:43,129 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-23 06:36:43,167 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-23 06:36:43,347 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-23 06:36:43,347 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-23 06:36:43,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1344923924, now seen corresponding path program 1 times [2022-07-23 06:36:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:43,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719814389] [2022-07-23 06:36:43,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:43,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:43,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:43,349 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-23 06:36:43,352 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-23 06:36:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:43,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:36:43,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:43,526 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-23 06:36:43,857 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-23 06:36:43,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:36:43,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:43,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719814389] [2022-07-23 06:36:43,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [719814389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:36:43,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:36:43,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:36:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737392258] [2022-07-23 06:36:43,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:36:43,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:36:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:36:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:36:43,858 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-23 06:36:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:44,438 INFO L93 Difference]: Finished difference Result 134 states and 142 transitions. [2022-07-23 06:36:44,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:36:44,439 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-23 06:36:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:44,439 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:36:44,439 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:36:44,440 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-23 06:36:44,440 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 413 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:44,440 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.4s Time] [2022-07-23 06:36:44,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:36:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 100. [2022-07-23 06:36:44,442 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-23 06:36:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-23 06:36:44,442 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 45 [2022-07-23 06:36:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:44,442 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-23 06:36:44,442 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-23 06:36:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-23 06:36:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-23 06:36:44,443 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:44,443 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-23 06:36:44,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-23 06:36:44,659 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-23 06:36:44,659 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-23 06:36:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:44,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1217170439, now seen corresponding path program 3 times [2022-07-23 06:36:44,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:44,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140439748] [2022-07-23 06:36:44,660 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:36:44,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:44,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:44,661 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-23 06:36:44,663 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-23 06:36:44,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-23 06:36:44,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:36:44,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:36:44,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:45,077 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-23 06:36:45,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:45,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:45,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140439748] [2022-07-23 06:36:45,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140439748] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:45,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [233553977] [2022-07-23 06:36:45,374 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 06:36:45,374 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:36:45,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:36:45,388 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-23 06:36:45,389 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-23 06:36:45,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-23 06:36:45,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:36:45,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-23 06:36:45,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:45,773 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-23 06:36:45,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:45,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [233553977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:45,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:45,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2022-07-23 06:36:45,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398692616] [2022-07-23 06:36:45,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:45,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 06:36:45,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:45,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 06:36:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-23 06:36:45,981 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-23 06:36:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:46,113 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-07-23 06:36:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:36:46,114 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-23 06:36:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:46,114 INFO L225 Difference]: With dead ends: 95 [2022-07-23 06:36:46,114 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 06:36:46,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-23 06:36:46,115 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-23 06:36:46,115 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-23 06:36:46,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 06:36:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-23 06:36:46,117 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-23 06:36:46,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2022-07-23 06:36:46,117 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 46 [2022-07-23 06:36:46,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:46,118 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2022-07-23 06:36:46,118 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-23 06:36:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2022-07-23 06:36:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-23 06:36:46,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:46,119 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-23 06:36:46,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-23 06:36:46,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2022-07-23 06:36:46,539 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-23 06:36:46,539 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-23 06:36:46,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:46,540 INFO L85 PathProgramCache]: Analyzing trace with hash -399124699, now seen corresponding path program 1 times [2022-07-23 06:36:46,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:46,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [521773247] [2022-07-23 06:36:46,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:46,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:46,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:46,544 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-23 06:36:46,545 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-23 06:36:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:46,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-23 06:36:46,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:46,807 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-23 06:36:46,935 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:46,936 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-23 06:36:47,008 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-23 06:36:47,100 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:47,100 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-23 06:36:47,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:47,298 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-23 06:36:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-23 06:36:47,496 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-23 06:36:47,641 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-23 06:36:47,836 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-23 06:36:47,981 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-23 06:36:47,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:48,313 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-23 06:36:48,330 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-23 06:36:48,340 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-23 06:36:48,354 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-23 06:36:48,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:48,374 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-23 06:36:48,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:48,393 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-23 06:36:48,400 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-23 06:36:48,840 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-23 06:36:48,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-23 06:36:48,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:48,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 06:36:48,860 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-23 06:36:48,864 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-23 06:36:49,410 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-23 06:36:49,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:49,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [521773247] [2022-07-23 06:36:49,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [521773247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:36:49,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:49,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 46 [2022-07-23 06:36:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999825046] [2022-07-23 06:36:49,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-23 06:36:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-23 06:36:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1463, Unknown=6, NotChecked=486, Total=2070 [2022-07-23 06:36:49,411 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-23 06:36:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:52,569 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-23 06:36:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 06:36:52,572 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-23 06:36:52,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:52,572 INFO L225 Difference]: With dead ends: 94 [2022-07-23 06:36:52,572 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 06:36:52,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=283, Invalid=2927, Unknown=6, NotChecked=690, Total=3906 [2022-07-23 06:36:52,574 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 200 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1266 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 558 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:52,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1266 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 893 Invalid, 0 Unknown, 558 Unchecked, 1.6s Time] [2022-07-23 06:36:52,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 06:36:52,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-23 06:36:52,575 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-23 06:36:52,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-23 06:36:52,575 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 49 [2022-07-23 06:36:52,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:52,576 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-23 06:36:52,576 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-23 06:36:52,576 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-23 06:36:52,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 06:36:52,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:52,576 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-23 06:36:52,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-23 06:36:52,785 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-23 06:36:52,786 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-23 06:36:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash 780049028, now seen corresponding path program 1 times [2022-07-23 06:36:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:52,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978090352] [2022-07-23 06:36:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:52,788 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-23 06:36:52,789 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-23 06:36:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:52,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:36:52,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:53,020 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-23 06:36:53,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:53,092 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-23 06:36:53,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:53,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978090352] [2022-07-23 06:36:53,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978090352] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:36:53,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:36:53,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-23 06:36:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929587560] [2022-07-23 06:36:53,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:36:53,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:36:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:36:53,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:36:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:36:53,094 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-23 06:36:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:36:53,230 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2022-07-23 06:36:53,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 06:36:53,235 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-23 06:36:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:36:53,236 INFO L225 Difference]: With dead ends: 134 [2022-07-23 06:36:53,236 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 06:36:53,236 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-23 06:36:53,236 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 129 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:36:53,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 459 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:36:53,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 06:36:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 98. [2022-07-23 06:36:53,238 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-23 06:36:53,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-07-23 06:36:53,238 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 55 [2022-07-23 06:36:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:36:53,239 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-07-23 06:36:53,239 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-23 06:36:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-07-23 06:36:53,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 06:36:53,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:36:53,239 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-23 06:36:53,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-23 06:36:53,439 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-23 06:36:53,440 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-23 06:36:53,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:36:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 780048973, now seen corresponding path program 1 times [2022-07-23 06:36:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:36:53,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859455947] [2022-07-23 06:36:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:53,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:36:53,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:36:53,442 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-23 06:36:53,445 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-23 06:36:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:53,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-23 06:36:53,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:53,929 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-23 06:36:54,118 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:36:54,119 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-23 06:36:54,240 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-23 06:36:54,250 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-23 06:36:54,426 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:54,426 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-23 06:36:54,432 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-23 06:36:54,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:54,808 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-23 06:36:54,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:54,822 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-23 06:36:54,836 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-23 06:36:55,197 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-23 06:36:55,441 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-23 06:36:55,461 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:36:55,461 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-23 06:36:55,624 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-23 06:36:55,750 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-23 06:36:55,750 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:36:55,949 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_#t~mem12#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-23 06:36:55,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (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_1230) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-07-23 06:36:55,968 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-23 06:36:56,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1226 (_ BitVec 32)) (v_ArrVal_1230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1226)) (select .cse0 |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|)))) is different from false [2022-07-23 06:36:56,197 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_~head~0#1.base|))) (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_1226)) (select .cse0 |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|)) (_ bv1 1))) is different from false [2022-07-23 06:36:56,213 INFO L356 Elim1Store]: treesize reduction 5, result has 86.8 percent of original size [2022-07-23 06:36:56,213 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 42 treesize of output 41 [2022-07-23 06:36:56,221 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-23 06:36:56,234 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-23 06:36:56,241 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:36:56,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 42 [2022-07-23 06:36:56,244 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-23 06:36:56,247 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-23 06:36:56,251 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-23 06:36:56,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:36:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859455947] [2022-07-23 06:36:56,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859455947] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:36:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [841753178] [2022-07-23 06:36:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:36:56,472 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:36:56,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:36:56,473 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-23 06:36:56,481 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-23 06:36:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:36:56,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-23 06:36:56,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:36:56,870 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-23 06:36:57,188 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:36:57,188 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-23 06:36:57,385 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-23 06:36:57,593 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-23 06:36:58,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:36:58,245 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-23 06:36:58,253 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-23 06:36:58,609 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-23 06:36:58,973 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:36:58,974 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-23 06:36:58,986 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-23 06:36:58,990 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-23 06:36:59,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:36:59,662 INFO L356 Elim1Store]: treesize reduction 12, result has 57.1 percent of original size [2022-07-23 06:36:59,662 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-23 06:37:00,284 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-23 06:37:00,293 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-23 06:37:00,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:37:01,061 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-23 06:37:02,112 INFO L356 Elim1Store]: treesize reduction 17, result has 64.6 percent of original size [2022-07-23 06:37:02,112 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-23 06:37:02,158 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:02,159 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-23 06:37:02,167 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-23 06:37:11,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:11,361 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-23 06:37:11,364 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-23 06:37:11,369 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-23 06:37:16,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [841753178] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:37:16,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:37:16,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 47 [2022-07-23 06:37:16,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114520613] [2022-07-23 06:37:16,924 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:37:16,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 06:37:16,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:37:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 06:37:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=5348, Unknown=27, NotChecked=1078, Total=6806 [2022-07-23 06:37:16,926 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-23 06:37:24,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:37:24,280 INFO L93 Difference]: Finished difference Result 157 states and 164 transitions. [2022-07-23 06:37:24,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 06:37:24,282 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-23 06:37:24,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:37:24,283 INFO L225 Difference]: With dead ends: 157 [2022-07-23 06:37:24,283 INFO L226 Difference]: Without dead ends: 157 [2022-07-23 06:37:24,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 104 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2339 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=1019, Invalid=8684, Unknown=27, NotChecked=1400, Total=11130 [2022-07-23 06:37:24,285 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 847 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 643 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:37:24,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 1655 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 915 Invalid, 0 Unknown, 643 Unchecked, 1.5s Time] [2022-07-23 06:37:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-23 06:37:24,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2022-07-23 06:37:24,287 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-23 06:37:24,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-07-23 06:37:24,288 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 55 [2022-07-23 06:37:24,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:37:24,288 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-07-23 06:37:24,288 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-23 06:37:24,288 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-07-23 06:37:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-23 06:37:24,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:37:24,288 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-23 06:37:24,294 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-23 06:37:24,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-23 06:37:24,689 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-23 06:37:24,689 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-23 06:37:24,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:37:24,689 INFO L85 PathProgramCache]: Analyzing trace with hash 780048974, now seen corresponding path program 1 times [2022-07-23 06:37:24,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:37:24,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481639427] [2022-07-23 06:37:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:37:24,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:37:24,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:37:24,701 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-23 06:37:24,703 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-23 06:37:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:37:25,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-23 06:37:25,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:37:25,078 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-23 06:37:25,084 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-23 06:37:25,336 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:37:25,336 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-23 06:37:25,355 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:37:25,355 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-23 06:37:25,457 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-23 06:37:25,465 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-23 06:37:25,616 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:37:25,617 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-23 06:37:25,621 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-23 06:37:25,995 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-23 06:37:26,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:37:26,002 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-23 06:37:26,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:37:26,012 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-23 06:37:26,546 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:37:26,546 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-23 06:37:26,551 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-23 06:37:26,563 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-23 06:37:26,776 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-23 06:37:26,781 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-23 06:37:26,878 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-23 06:37:26,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:37:27,416 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-23 06:37:27,447 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-23 06:37:27,472 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-23 06:37:27,504 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-23 06:37:27,572 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-23 06:37:27,622 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-23 06:37:27,666 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-23 06:37:27,692 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-23 06:37:27,734 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-23 06:37:27,804 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-23 06:37:27,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:27,819 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-23 06:37:27,822 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-23 06:37:27,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:27,849 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-23 06:37:27,851 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-23 06:37:27,854 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-23 06:37:27,864 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-23 06:37:27,866 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-23 06:37:27,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:27,918 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-23 06:37:27,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:37:27,930 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-23 06:37:27,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:27,946 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-23 06:37:27,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:37:27,953 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-23 06:37:27,960 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-23 06:37:27,968 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-23 06:37:32,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:37:32,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481639427] [2022-07-23 06:37:32,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481639427] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:37:32,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [949518050] [2022-07-23 06:37:32,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:37:32,577 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:37:32,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:37:32,579 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-23 06:37:32,580 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-23 06:37:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:37:32,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 06:37:32,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:37:32,987 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-23 06:37:32,994 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-23 06:37:33,435 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:37:33,435 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-23 06:37:33,452 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:37:33,452 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-23 06:37:33,645 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-23 06:37:33,848 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:37:33,849 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-23 06:37:34,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:37:34,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, 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-23 06:37:34,510 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:37:34,511 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-23 06:37:34,515 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-23 06:37:35,075 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-23 06:37:35,079 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-23 06:37:35,357 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-23 06:37:35,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:37:36,524 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:36,524 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-23 06:37:36,532 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 93 treesize of output 91 [2022-07-23 06:37:36,539 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 91 treesize of output 87 [2022-07-23 06:37:39,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:37:39,621 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-23 06:37:39,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 65 treesize of output 53 [2022-07-23 06:37:39,631 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-23 06:37:41,638 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-23 06:37:41,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [949518050] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:37:41,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 06:37:41,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 23] total 66 [2022-07-23 06:37:41,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887960735] [2022-07-23 06:37:41,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 06:37:41,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-23 06:37:41,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:37:41,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-23 06:37:41,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=4547, Unknown=33, NotChecked=1450, Total=6320 [2022-07-23 06:37:41,641 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-23 06:37:50,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:37:50,943 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2022-07-23 06:37:50,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 06:37:50,944 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-23 06:37:50,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:37:50,945 INFO L225 Difference]: With dead ends: 176 [2022-07-23 06:37:50,945 INFO L226 Difference]: Without dead ends: 176 [2022-07-23 06:37:50,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2166 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=979, Invalid=8148, Unknown=33, NotChecked=1970, Total=11130 [2022-07-23 06:37:50,947 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1504 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 1474 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 614 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:37:50,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 1474 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 874 Invalid, 0 Unknown, 614 Unchecked, 1.9s Time] [2022-07-23 06:37:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-23 06:37:50,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 101. [2022-07-23 06:37:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 96 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-23 06:37:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-07-23 06:37:50,949 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 55 [2022-07-23 06:37:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:37:50,949 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-07-23 06:37:50,950 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-23 06:37:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-07-23 06:37:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 06:37:50,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:37:50,950 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-23 06:37:50,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-23 06:37:51,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2022-07-23 06:37:51,350 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-23 06:37:51,351 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-23 06:37:51,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:37:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1039883103, now seen corresponding path program 1 times [2022-07-23 06:37:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:37:51,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [305131186] [2022-07-23 06:37:51,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:37:51,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:37:51,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:37:51,353 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-23 06:37:51,354 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-23 06:37:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:37:51,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-23 06:37:51,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:37:51,778 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-23 06:37:51,978 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:37:51,978 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-23 06:37:52,064 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-23 06:37:52,071 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-23 06:37:52,188 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:37:52,189 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-23 06:37:52,194 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-23 06:37:52,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:37:52,454 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-23 06:37:52,466 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-23 06:37:52,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:37:52,481 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-23 06:37:53,091 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:37:53,092 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-23 06:37:53,098 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-23 06:37:53,104 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-23 06:37:53,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 31 treesize of output 23 [2022-07-23 06:37:53,702 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-23 06:37:53,915 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:37:53,915 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-23 06:37:54,075 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-23 06:37:54,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:37:54,881 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-23 06:37:54,916 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-23 06:37:54,952 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-23 06:37:55,001 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-23 06:37:55,032 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-23 06:37:55,054 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-23 06:37:55,612 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))))) (and (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse1 (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_1504)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2) (or (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 ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse7 (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|) .cse8 v_ArrVal_1504)))) (let ((.cse4 (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|) .cse8 v_ArrVal_1505))) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 .cse6 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select (select (store .cse7 .cse6 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse3)) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse3)) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse5)) (not (= .cse6 .cse5)))))))) .cse9) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1504)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 .cse11 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse10) (= .cse11 .cse10)))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse14 (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|) .cse15 v_ArrVal_1505)))) (let ((.cse13 (select (select (store .cse14 (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|) .cse15 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse13) (= (select (select .cse14 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse13)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse16 (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|) .cse16 v_ArrVal_1505)) (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|) .cse16 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse18 (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_1504)))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse17 (select (select (store .cse18 .cse17 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or .cse9 (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse19 (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_1504)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse20 (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|) .cse20 v_ArrVal_1505)) (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|) .cse20 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (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 ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse24 (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|) .cse23 v_ArrVal_1504)))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (let ((.cse21 (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|) .cse23 v_ArrVal_1505)))) (= (select (select .cse21 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse21 .cse22 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= .cse22 (select (select (store .cse24 .cse22 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse2)) (or (and (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (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_1504)))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse26 (select (select (store .cse27 .cse25 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse25 .cse26) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse26))))))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse28 (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|) .cse28 v_ArrVal_1505)) (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|) .cse28 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse31 (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|) .cse32 v_ArrVal_1505)))) (let ((.cse30 (select (select (store .cse31 (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|) .cse32 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse29 (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_1504)))) (store .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse30)) (= (select (select .cse31 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse30)))))) (or (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 ((.cse33 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse35 (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|) .cse33 v_ArrVal_1504)))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (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|) .cse33 v_ArrVal_1505)) .cse34 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store .cse35 .cse34 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse9)) .cse2) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse36 (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_1504)))) (store .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse38 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse37 (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|) .cse38 v_ArrVal_1505)))) (= (select (select .cse37 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse37 (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|) .cse38 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse40 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse39 (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|) .cse40 v_ArrVal_1505)))) (= (select (select .cse39 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse39 (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|) .cse40 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2))) is different from false [2022-07-23 06:37:57,627 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))))) (and (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse1 (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_1504)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2) (or (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 ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse7 (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|) .cse8 v_ArrVal_1504)))) (let ((.cse4 (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|) .cse8 v_ArrVal_1505))) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 .cse6 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select (select (store .cse7 .cse6 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse3)) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse3)) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse5)) (not (= .cse6 .cse5)))))))) .cse9) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1504)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 .cse11 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse10) (= .cse11 .cse10)))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse14 (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|) .cse15 v_ArrVal_1505)))) (let ((.cse13 (select (select (store .cse14 (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|) .cse15 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse13) (= (select (select .cse14 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse13)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse16 (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|) .cse16 v_ArrVal_1505)) (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|) .cse16 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse18 (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_1504)))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse17 (select (select (store .cse18 .cse17 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or .cse9 (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse19 (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_1504)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse20 (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|) .cse20 v_ArrVal_1505)) (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|) .cse20 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (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 ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse24 (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|) .cse23 v_ArrVal_1504)))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (let ((.cse21 (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|) .cse23 v_ArrVal_1505)))) (= (select (select .cse21 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse21 .cse22 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= .cse22 (select (select (store .cse24 .cse22 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse2)) (or (and (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (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_1504)))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse26 (select (select (store .cse27 .cse25 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse25 .cse26) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse26))))))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse28 (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|) .cse28 v_ArrVal_1505)) (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|) .cse28 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse31 (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|) .cse32 v_ArrVal_1505)))) (let ((.cse30 (select (select (store .cse31 (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|) .cse32 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse29 (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_1504)))) (store .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse30)) (= (select (select .cse31 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse30)))))) (or (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 ((.cse33 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse35 (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|) .cse33 v_ArrVal_1504)))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (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|) .cse33 v_ArrVal_1505)) .cse34 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store .cse35 .cse34 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse9)) .cse2) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse36 (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_1504)))) (store .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse38 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse37 (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|) .cse38 v_ArrVal_1505)))) (= (select (select .cse37 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse37 (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|) .cse38 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse40 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse39 (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|) .cse40 v_ArrVal_1505)))) (= (select (select .cse39 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse39 (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|) .cse40 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2))) is different from true [2022-07-23 06:37:57,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))))) (and (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse1 (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_1504)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2) (or (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 ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse7 (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|) .cse8 v_ArrVal_1504)))) (let ((.cse4 (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|) .cse8 v_ArrVal_1505))) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 .cse6 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select (select (store .cse7 .cse6 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse3)) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse3)) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse5)) (not (= .cse6 .cse5)))))))) .cse9) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1504)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 .cse11 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse10) (= .cse11 .cse10)))))) (or (and (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (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_1504)))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 .cse13 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse13 .cse14) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse14))))))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse16 (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|) .cse16 v_ArrVal_1505)) (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|) .cse16 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse20 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse19 (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|) .cse20 v_ArrVal_1505)))) (let ((.cse18 (select (select (store .cse19 (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|) .cse20 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse17 (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_1504)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse18)) (= (select (select .cse19 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse18))))))) .cse2) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse22 (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|) .cse23 v_ArrVal_1505)))) (let ((.cse21 (select (select (store .cse22 (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|) .cse23 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse21) (= (select (select .cse22 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse21)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse24 (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|) .cse24 v_ArrVal_1505)) (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|) .cse24 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse26 (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_1504)))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse25 (select (select (store .cse26 .cse25 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or .cse9 (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse27 (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_1504)))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse28 (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|) .cse28 v_ArrVal_1505)) (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|) .cse28 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (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 ((.cse31 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse32 (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|) .cse31 v_ArrVal_1504)))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (let ((.cse29 (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|) .cse31 v_ArrVal_1505)))) (= (select (select .cse29 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse29 .cse30 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= .cse30 (select (select (store .cse32 .cse30 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse2)) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse33 (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_1504)))) (store .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse35 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse34 (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|) .cse35 v_ArrVal_1505)))) (= (select (select .cse34 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse34 (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|) .cse35 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse37 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse36 (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|) .cse37 v_ArrVal_1505)))) (= (select (select .cse36 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse36 (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|) .cse37 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2))) is different from false [2022-07-23 06:37:59,999 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))))) (and (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse1 (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_1504)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2) (or (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 ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse7 (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|) .cse8 v_ArrVal_1504)))) (let ((.cse4 (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|) .cse8 v_ArrVal_1505))) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 .cse6 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select (select (store .cse7 .cse6 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse3)) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse3)) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse5)) (not (= .cse6 .cse5)))))))) .cse9) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1504)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 .cse11 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse10) (= .cse11 .cse10)))))) (or (and (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (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_1504)))) (let ((.cse13 (select (select .cse15 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse14 (select (select (store .cse15 .cse13 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse13 .cse14) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse14))))))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse16 (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|) .cse16 v_ArrVal_1505)) (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|) .cse16 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse20 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse19 (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|) .cse20 v_ArrVal_1505)))) (let ((.cse18 (select (select (store .cse19 (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|) .cse20 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse17 (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_1504)))) (store .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse18)) (= (select (select .cse19 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse18))))))) .cse2) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse22 (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|) .cse23 v_ArrVal_1505)))) (let ((.cse21 (select (select (store .cse22 (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|) .cse23 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse21) (= (select (select .cse22 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse21)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse24 (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|) .cse24 v_ArrVal_1505)) (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|) .cse24 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse26 (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_1504)))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse25 (select (select (store .cse26 .cse25 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or .cse9 (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse27 (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_1504)))) (store .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse28 (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|) .cse28 v_ArrVal_1505)) (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|) .cse28 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (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 ((.cse31 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse32 (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|) .cse31 v_ArrVal_1504)))) (let ((.cse30 (select (select .cse32 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (let ((.cse29 (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|) .cse31 v_ArrVal_1505)))) (= (select (select .cse29 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse29 .cse30 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= .cse30 (select (select (store .cse32 .cse30 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse2)) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse33 (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_1504)))) (store .cse33 (select (select .cse33 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse35 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse34 (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|) .cse35 v_ArrVal_1505)))) (= (select (select .cse34 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse34 (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|) .cse35 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse37 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse36 (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|) .cse37 v_ArrVal_1505)))) (= (select (select .cse36 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse36 (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|) .cse37 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2))) is different from true [2022-07-23 06:38:00,105 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse18 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse18 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1504)) (select .cse18 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (.cse11 (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse17 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse17 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1505)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select .cse17 |c_ULTIMATE.start_main_~s~0#1.offset|))))) (.cse1 (= (_ bv1 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse0 (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse16 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse16 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1504)) (select .cse16 |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (.cse10 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|))) (and (or .cse0 .cse1 (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1505)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse2 |c_ULTIMATE.start_main_~s~0#1.offset|)) (= .cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1505)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse4 (select .cse5 |c_ULTIMATE.start_main_~s~0#1.offset|)) (= .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))))) (or (and .cse6 (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (not (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse7 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1505)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select .cse7 |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (not (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse8 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1504)) .cse8 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) .cse1 (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1505)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|))) .cse10) (or .cse6 .cse11) (or .cse11 .cse1) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse12 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse13 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1504)) .cse12 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse15 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1505)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= .cse14 (select .cse15 |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= .cse14 |c_ULTIMATE.start_main_~s~0#1.offset|)))))) .cse0 .cse10))) is different from false [2022-07-23 06:38:00,147 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |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_1505)) (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_1506) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (or (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_#res#1.base|))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1505)) (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_1506) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (= .cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (not (= .cse1 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (not (= (select (select (let ((.cse3 (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 .cse3 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1504)) (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) |c_ULTIMATE.start_sll_circular_create_#res#1.base|)))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse5 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1505)) (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_1506) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (= .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (= .cse4 (select .cse5 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse7 (select .cse6 |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 .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1504)) .cse7 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) .cse7))))) is different from false [2022-07-23 06:38:00,180 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)))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |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 |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|))) (or (not (= .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse2))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (not (= (select (select (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1504)) (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1508)) |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_~head~0#1.base|)))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (= (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (select (store (store |c_#memory_$Pointer$.offset| |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_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|)))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse7 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse7 (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|))) (or (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse6)))))) is different from false [2022-07-23 06:38:00,262 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1498))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse0 (select (select (store (store .cse2 |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_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|))) (or (not (= .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (store (store .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1504)) (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1508))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (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 ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1498))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse6 (select (select (store (store .cse7 |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_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|))) (or (= (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse6) (= .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (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 ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1498))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (= (select .cse8 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (select (select (store (store .cse9 |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_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|))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32)) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (select (store (store .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1504)) .cse12 v_ArrVal_1508) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse12)))))) is different from false [2022-07-23 06:38:00,381 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|))) (= (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|) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) (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_~new_head~0#1.base|))) (let ((.cse2 (select (select (store (store .cse4 |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_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|))) (or (= .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= .cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_ArrVal_1498 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1499 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (store (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1504)) (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 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|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1498))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse7 (select (select (store (store .cse9 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse8 (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|))) (or (not (= .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= .cse7 (select .cse8 |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 ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1499))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (select (store (store .cse10 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse11 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1504)) .cse12 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|) .cse12)))))) is different from false [2022-07-23 06:38:00,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:00,410 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 131 treesize of output 99 [2022-07-23 06:38:00,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:38:00,420 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 56 treesize of output 48 [2022-07-23 06:38:00,430 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:00,431 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 58 treesize of output 43 [2022-07-23 06:38:00,439 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 45 treesize of output 37 [2022-07-23 06:38:00,444 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 30 [2022-07-23 06:38:00,449 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 30 treesize of output 26 [2022-07-23 06:38:00,454 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 44 treesize of output 36 [2022-07-23 06:38:00,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 9 treesize of output 7 [2022-07-23 06:38:00,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:00,486 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 98 [2022-07-23 06:38:00,489 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:38:00,491 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 107 treesize of output 95 [2022-07-23 06:38:00,506 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:00,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, 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-23 06:38:00,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:38:00,561 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-23 06:38:00,585 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-23 06:38:00,595 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:38:00,596 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 72 treesize of output 1 [2022-07-23 06:38:00,617 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:38:00,617 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 72 treesize of output 1 [2022-07-23 06:38:01,571 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-23 06:38:01,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:01,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [305131186] [2022-07-23 06:38:01,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [305131186] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:38:01,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:38:01,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 62 [2022-07-23 06:38:01,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984810714] [2022-07-23 06:38:01,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:38:01,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-23 06:38:01,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-23 06:38:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=2317, Unknown=14, NotChecked=1284, Total=3782 [2022-07-23 06:38:01,579 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 62 states, 61 states have (on average 1.7704918032786885) internal successors, (108), 56 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-23 06:38:10,495 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse9 (= (_ bv0 32) |c_ULTIMATE.start_main_~i~0#1|)) (.cse2 (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| (_ bv1 32))))) (and (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse1 (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_1504)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2) (= |c_ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (or (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 ((.cse8 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse7 (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|) .cse8 v_ArrVal_1504)))) (let ((.cse4 (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|) .cse8 v_ArrVal_1505))) (.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse3 (select (select (store .cse4 .cse6 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse5 (select (select (store .cse7 .cse6 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse3)) (not (= (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse3)) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse5)) (not (= .cse6 .cse5)))))))) .cse9) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (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|) (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1504)))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse10 (select (select (store .cse12 .cse11 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse10) (= .cse11 .cse10)))))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| |c_ULTIMATE.start_main_~s~0#1.offset|) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse15 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse14 (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|) .cse15 v_ArrVal_1505)))) (let ((.cse13 (select (select (store .cse14 (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|) .cse15 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse13) (= (select (select .cse14 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse13)))))) (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse16 (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|) .cse16 v_ArrVal_1505)) (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|) .cse16 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse18 (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_1504)))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= .cse17 (select (select (store .cse18 .cse17 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (or .cse9 (and (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse19 (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_1504)))) (store .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse20 (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|) .cse20 v_ArrVal_1505)) (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|) .cse20 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (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 ((.cse23 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse24 (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|) .cse23 v_ArrVal_1504)))) (let ((.cse22 (select (select .cse24 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (let ((.cse21 (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|) .cse23 v_ArrVal_1505)))) (= (select (select .cse21 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse21 .cse22 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= .cse22 (select (select (store .cse24 .cse22 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse2)) (or (and (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (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_1504)))) (let ((.cse25 (select (select .cse27 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse26 (select (select (store .cse27 .cse25 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (= .cse25 .cse26) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| .cse26))))))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (select (select (let ((.cse28 (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|) .cse28 v_ArrVal_1505)) (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|) .cse28 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse32 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse31 (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|) .cse32 v_ArrVal_1505)))) (let ((.cse30 (select (select (store .cse31 (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|) .cse32 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse29 (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_1504)))) (store .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| .cse30)) (= (select (select .cse31 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse30)))))) (or (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 ((.cse33 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse35 (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|) .cse33 v_ArrVal_1504)))) (let ((.cse34 (select (select .cse35 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| (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|) .cse33 v_ArrVal_1505)) .cse34 v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (store .cse35 .cse34 v_ArrVal_1508) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) .cse9)) .cse2) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (bvadd |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (or (forall ((v_ArrVal_1508 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select (let ((.cse36 (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_1504)))) (store .cse36 (select (select .cse36 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1508)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse38 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse37 (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|) .cse38 v_ArrVal_1505)))) (= (select (select .cse37 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse37 (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|) .cse38 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (= (_ bv2 32) |c_ULTIMATE.start_main_~len~0#1|) .cse9 (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) (or (forall ((v_ArrVal_1506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1505 (_ BitVec 32)) (v_ArrVal_1504 (_ BitVec 32))) (let ((.cse40 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (let ((.cse39 (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|) .cse40 v_ArrVal_1505)))) (= (select (select .cse39 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (select (select (store .cse39 (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|) .cse40 v_ArrVal_1504)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1506) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) .cse2) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))) is different from true [2022-07-23 06:38:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:38:13,475 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2022-07-23 06:38:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-23 06:38:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.7704918032786885) internal successors, (108), 56 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-23 06:38:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:38:13,477 INFO L225 Difference]: With dead ends: 133 [2022-07-23 06:38:13,477 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 06:38:13,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 74 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=280, Invalid=3663, Unknown=15, NotChecked=1742, Total=5700 [2022-07-23 06:38:13,478 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 99 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 2010 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1182 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:38:13,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 2010 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1054 Invalid, 0 Unknown, 1182 Unchecked, 2.2s Time] [2022-07-23 06:38:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 06:38:13,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 105. [2022-07-23 06:38:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 100 states have internal predecessors, (106), 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-23 06:38:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-07-23 06:38:13,487 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 59 [2022-07-23 06:38:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:38:13,487 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-07-23 06:38:13,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.7704918032786885) internal successors, (108), 56 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-23 06:38:13,488 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-07-23 06:38:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-23 06:38:13,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:38:13,489 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-23 06:38:13,517 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-23 06:38:13,698 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-23 06:38:13,699 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-23 06:38:13,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:38:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash -786361131, now seen corresponding path program 1 times [2022-07-23 06:38:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:38:13,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001770230] [2022-07-23 06:38:13,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:38:13,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:38:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:38:13,701 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-23 06:38:13,703 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-23 06:38:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:38:13,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 06:38:13,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:13,945 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-23 06:38:14,133 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-23 06:38:14,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:38:14,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:14,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001770230] [2022-07-23 06:38:14,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1001770230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:38:14,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:38:14,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:38:14,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842755989] [2022-07-23 06:38:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:38:14,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:38:14,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:38:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:38:14,134 INFO L87 Difference]: Start difference. First operand 105 states and 110 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-23 06:38:14,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:38:14,742 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2022-07-23 06:38:14,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:38:14,743 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-23 06:38:14,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:38:14,743 INFO L225 Difference]: With dead ends: 123 [2022-07-23 06:38:14,743 INFO L226 Difference]: Without dead ends: 123 [2022-07-23 06:38:14,743 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-23 06:38:14,744 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:38:14,744 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.5s Time] [2022-07-23 06:38:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-23 06:38:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2022-07-23 06:38:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.2584269662921348) internal successors, (112), 103 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-23 06:38:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-07-23 06:38:14,746 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 63 [2022-07-23 06:38:14,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:38:14,746 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-07-23 06:38:14,746 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-23 06:38:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-07-23 06:38:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-23 06:38:14,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:38:14,747 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-23 06:38:14,763 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-23 06:38:14,957 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-23 06:38:14,957 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-23 06:38:14,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:38:14,957 INFO L85 PathProgramCache]: Analyzing trace with hash -786361130, now seen corresponding path program 1 times [2022-07-23 06:38:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:38:14,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841226699] [2022-07-23 06:38:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:38:14,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:38:14,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:38:14,959 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-23 06:38:14,961 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-23 06:38:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:38:15,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-23 06:38:15,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:15,174 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-23 06:38:15,570 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-23 06:38:15,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:38:15,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:15,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841226699] [2022-07-23 06:38:15,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841226699] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:38:15,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:38:15,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 06:38:15,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861058299] [2022-07-23 06:38:15,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:38:15,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:38:15,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:15,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:38:15,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:38:15,571 INFO L87 Difference]: Start difference. First operand 108 states and 116 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-23 06:38:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:38:16,235 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-07-23 06:38:16,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:38:16,236 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-23 06:38:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:38:16,236 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:38:16,236 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 06:38:16,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 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-23 06:38:16,237 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 215 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-07-23 06:38:16,237 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.5s Time] [2022-07-23 06:38:16,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 06:38:16,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-23 06:38:16,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2247191011235956) 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-23 06:38:16,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-23 06:38:16,239 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 63 [2022-07-23 06:38:16,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:38:16,239 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-23 06:38:16,239 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-23 06:38:16,239 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-23 06:38:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 06:38:16,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:38:16,239 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-23 06:38:16,270 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-23 06:38:16,455 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-23 06:38:16,455 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-23 06:38:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:38:16,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1392642591, now seen corresponding path program 1 times [2022-07-23 06:38:16,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:38:16,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420687299] [2022-07-23 06:38:16,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:38:16,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:38:16,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:38:16,457 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-23 06:38:16,458 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-23 06:38:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:38:16,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 06:38:16,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:16,803 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-23 06:38:16,803 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 06:38:16,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:16,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420687299] [2022-07-23 06:38:16,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420687299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 06:38:16,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 06:38:16,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 06:38:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35550579] [2022-07-23 06:38:16,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 06:38:16,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:38:16,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:16,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:38:16,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:38:16,805 INFO L87 Difference]: Start difference. First operand 106 states and 113 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-23 06:38:17,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:38:17,185 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2022-07-23 06:38:17,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 06:38:17,185 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-23 06:38:17,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:38:17,186 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:38:17,186 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 06:38:17,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 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-23 06:38:17,187 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.3s IncrementalHoareTripleChecker+Time [2022-07-23 06:38:17,187 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.3s Time] [2022-07-23 06:38:17,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 06:38:17,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-23 06:38:17,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 101 states have internal predecessors, (108), 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-23 06:38:17,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2022-07-23 06:38:17,189 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 64 [2022-07-23 06:38:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:38:17,189 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2022-07-23 06:38:17,189 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-23 06:38:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2022-07-23 06:38:17,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 06:38:17,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:38:17,190 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-23 06:38:17,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-23 06:38:17,398 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-23 06:38:17,399 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-23 06:38:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:38:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740515, now seen corresponding path program 1 times [2022-07-23 06:38:17,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:38:17,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [460322882] [2022-07-23 06:38:17,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:38:17,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:38:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:38:17,403 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-23 06:38:17,434 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-23 06:38:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:38:17,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 06:38:17,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:17,751 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-23 06:38:17,800 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-23 06:38:17,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:38:17,883 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-23 06:38:17,884 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-23 06:38:17,953 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-23 06:38:17,953 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-23 06:38:17,981 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-23 06:38:17,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:17,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [460322882] [2022-07-23 06:38:17,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [460322882] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:38:17,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:38:17,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-23 06:38:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291377553] [2022-07-23 06:38:17,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:38:17,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 06:38:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:17,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 06:38:17,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-23 06:38:17,983 INFO L87 Difference]: Start difference. First operand 106 states and 112 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-23 06:38:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:38:19,032 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2022-07-23 06:38:19,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 06:38:19,032 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-23 06:38:19,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:38:19,033 INFO L225 Difference]: With dead ends: 200 [2022-07-23 06:38:19,033 INFO L226 Difference]: Without dead ends: 200 [2022-07-23 06:38:19,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-07-23 06:38:19,034 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 240 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 06:38:19,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 452 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 06:38:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-23 06:38:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 106. [2022-07-23 06:38:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 90 states have (on average 1.211111111111111) 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-23 06:38:19,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2022-07-23 06:38:19,060 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 66 [2022-07-23 06:38:19,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:38:19,060 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2022-07-23 06:38:19,060 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-23 06:38:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2022-07-23 06:38:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 06:38:19,061 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:38:19,061 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-23 06:38:19,072 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-23 06:38:19,269 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-23 06:38:19,270 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-23 06:38:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:38:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1732740514, now seen corresponding path program 1 times [2022-07-23 06:38:19,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:38:19,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [26721010] [2022-07-23 06:38:19,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:38:19,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:38:19,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:38:19,272 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-23 06:38:19,273 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-23 06:38:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:38:19,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-23 06:38:19,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:19,662 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-23 06:38:19,680 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-23 06:38:19,957 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 06:38:19,957 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-23 06:38:19,972 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:38:19,973 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-23 06:38:20,052 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-23 06:38:20,057 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-23 06:38:20,176 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:38:20,176 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-23 06:38:20,180 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-23 06:38:20,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:38:20,428 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-23 06:38:20,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:38:20,435 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-23 06:38:20,728 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:38:20,728 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-23 06:38:20,734 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-23 06:38:21,349 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-23 06:38:21,354 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-23 06:38:21,503 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-23 06:38:21,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:38:22,394 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (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_1786) |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_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (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_1786) |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_1787) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-23 06:38:22,431 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (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_1786) |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_1787) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1786 (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_1786) |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-23 06:38:22,462 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (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_1786) |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_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (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 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1786) |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_1787) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-23 06:38:22,538 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (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 (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1786) |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_1787) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1786 (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_1786) |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-23 06:38:22,625 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ BitVec 32)) (v_ArrVal_1782 (_ 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_1782)))) (let ((.cse1 (select (select .cse2 |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|) .cse0 v_ArrVal_1783)) .cse1 v_ArrVal_1786) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1787) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ BitVec 32)) (v_ArrVal_1782 (_ 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_1783)) (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_1782)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1786)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) is different from false [2022-07-23 06:38:22,688 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ BitVec 32)) (v_ArrVal_1782 (_ 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_1783)) .cse1 v_ArrVal_1786) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv4 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_1782)) .cse1 v_ArrVal_1787) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ 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_1783)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1786) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (bvule .cse3 (bvadd .cse3 (_ bv4 32)))))) is different from false [2022-07-23 06:38:22,718 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ 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_1783)) (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_1786) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ BitVec 32)) (v_ArrVal_1782 (_ 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 (_ 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|) .cse1 v_ArrVal_1783)) .cse2 v_ArrVal_1786) |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 .cse3 .cse1 v_ArrVal_1782)) .cse2 v_ArrVal_1787) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))))) is different from false [2022-07-23 06:38:22,747 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ BitVec 32)) (v_ArrVal_1782 (_ 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_1783)) .cse1 v_ArrVal_1786) |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_1782)) .cse1 v_ArrVal_1787) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ 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_1783)) (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_1786) |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-23 06:38:22,854 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ 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_1780))) (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_1783))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1786) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ BitVec 32)) (v_ArrVal_1782 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781))) (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 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1780))) (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_1783))) .cse4 v_ArrVal_1786) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse6 .cse3 v_ArrVal_1782)) .cse4 v_ArrVal_1787) |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-23 06:38:22,988 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ 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_1780))) (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_1783))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1786) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1781 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1786 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1783 (_ BitVec 32)) (v_ArrVal_1782 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1781))) (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 (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1780))) (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_1783))) .cse4 v_ArrVal_1786) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse6 .cse3 v_ArrVal_1782)) .cse4 v_ArrVal_1787) |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-23 06:38:23,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:23,012 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-23 06:38:23,019 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-23 06:38:23,031 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:23,032 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-23 06:38:23,036 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-23 06:38:23,040 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-23 06:38:23,044 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-23 06:38:23,054 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-23 06:38:23,110 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:23,110 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-23 06:38:23,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:38:23,117 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-23 06:38:23,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:23,130 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-23 06:38:23,134 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 06:38:23,138 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-23 06:38:23,144 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-23 06:38:23,152 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-23 06:38:29,920 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 32 DAG size of output: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 06:38:29,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:29,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [26721010] [2022-07-23 06:38:29,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [26721010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:38:29,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [376816349] [2022-07-23 06:38:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:38:29,921 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:38:29,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:38:29,923 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:38:29,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2022-07-23 06:38:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:38:30,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-23 06:38:30,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:30,391 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-23 06:38:30,401 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-23 06:38:30,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:38:30,565 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-23 06:38:30,573 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-23 06:38:30,601 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-23 06:38:30,618 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-23 06:38:30,677 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:38:30,677 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-23 06:38:30,683 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-23 06:38:30,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:38:30,786 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-23 06:38:30,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:38:30,797 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-23 06:38:30,943 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:38:30,944 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-23 06:38:30,949 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-23 06:38:31,415 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-23 06:38:31,419 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-23 06:38:31,435 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-23 06:38:31,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:38:31,778 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1856) |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_~head#1.base| v_ArrVal_1857) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1856 (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_1856) |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-23 06:38:31,842 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1856) |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_#t~mem12#1.base| v_ArrVal_1857) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_1856 (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_1856) |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-23 06:38:31,876 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1856 (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_1856) |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_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (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_1856) |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_1857) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-23 06:38:31,917 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1856 (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_1856) |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_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (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_1856) |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_1857) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-23 06:38:31,993 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (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_1853)))) (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_1854)) .cse1 v_ArrVal_1856) |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_1857) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ 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_1854)) (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_1853)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1856)) |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-23 06:38:32,060 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ 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_1854)) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1856) |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_1853 (_ BitVec 32)) (v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (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_1854)) .cse2 v_ArrVal_1856) |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_1853)) .cse2 v_ArrVal_1857) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-07-23 06:38:32,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (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_1854)) .cse1 v_ArrVal_1856) |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_1853)) .cse1 v_ArrVal_1857) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) (forall ((v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ 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_1854)) (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_1856) |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-23 06:38:32,122 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (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_1854)) .cse1 v_ArrVal_1856) |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_1853)) .cse1 v_ArrVal_1857) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (forall ((v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1856 (Array (_ BitVec 32) (_ 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_1854)) (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_1856) |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-23 06:38:32,166 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1856 (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_1851))) (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_1854))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1850) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1856) |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_1853 (_ BitVec 32)) (v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1850))) (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_1851))) (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_1854))) .cse4 v_ArrVal_1856) |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_1853)) .cse4 v_ArrVal_1857) |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-23 06:38:32,242 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1853 (_ BitVec 32)) (v_ArrVal_1854 (_ BitVec 32)) (v_ArrVal_1850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1856 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1857 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1850))) (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_1851))) (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_1854))) .cse2 v_ArrVal_1856) |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_1853)) .cse2 v_ArrVal_1857) |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_1854 (_ BitVec 32)) (v_ArrVal_1850 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1856 (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_1851))) (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_1854))) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1850) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1856) |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-23 06:38:32,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:32,265 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 108 [2022-07-23 06:38:32,271 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 352 treesize of output 344 [2022-07-23 06:38:32,286 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:32,286 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 340 treesize of output 220 [2022-07-23 06:38:32,299 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 458 treesize of output 390 [2022-07-23 06:38:32,305 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 386 treesize of output 370 [2022-07-23 06:38:32,322 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 370 treesize of output 338 [2022-07-23 06:38:32,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 172 treesize of output 164 [2022-07-23 06:38:32,342 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 330 treesize of output 314 [2022-07-23 06:38:39,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:39,734 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-23 06:38:39,741 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-23 06:38:39,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:39,756 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-23 06:38:39,762 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-23 06:38:39,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 122 treesize of output 114 [2022-07-23 06:38:39,774 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-23 06:38:39,784 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-23 06:38:44,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [376816349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:38:44,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:38:44,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2022-07-23 06:38:44,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527130738] [2022-07-23 06:38:44,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:38:44,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-23 06:38:44,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:44,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-23 06:38:44,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=930, Unknown=20, NotChecked=1580, Total=2652 [2022-07-23 06:38:44,733 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 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-23 06:38:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:38:48,847 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2022-07-23 06:38:48,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 06:38:48,848 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 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 66 [2022-07-23 06:38:48,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:38:48,849 INFO L225 Difference]: With dead ends: 159 [2022-07-23 06:38:48,849 INFO L226 Difference]: Without dead ends: 159 [2022-07-23 06:38:48,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 171 SyntacticMatches, 3 SemanticMatches, 67 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=275, Invalid=2137, Unknown=20, NotChecked=2260, Total=4692 [2022-07-23 06:38:48,849 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 246 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 06:38:48,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 640 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 976 Invalid, 0 Unknown, 154 Unchecked, 1.9s Time] [2022-07-23 06:38:48,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-23 06:38:48,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 108. [2022-07-23 06:38:48,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.1956521739130435) internal successors, (110), 103 states have internal predecessors, (110), 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-23 06:38:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2022-07-23 06:38:48,852 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 66 [2022-07-23 06:38:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:38:48,852 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2022-07-23 06:38:48,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2916666666666665) internal successors, (55), 22 states have internal predecessors, (55), 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-23 06:38:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2022-07-23 06:38:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 06:38:48,852 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:38:48,852 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2022-07-23 06:38:48,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Forceful destruction successful, exit code 0 [2022-07-23 06:38:49,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2022-07-23 06:38:49,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-23 06:38:49,257 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-23 06:38:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:38:49,258 INFO L85 PathProgramCache]: Analyzing trace with hash -720162444, now seen corresponding path program 2 times [2022-07-23 06:38:49,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:38:49,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254110589] [2022-07-23 06:38:49,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:38:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:38:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:38:49,259 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:38:49,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-23 06:38:49,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:38:49,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:38:49,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 06:38:49,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:38:49,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:38:49,759 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-23 06:38:49,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:49,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254110589] [2022-07-23 06:38:49,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254110589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:38:49,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:38:49,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-23 06:38:49,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073750083] [2022-07-23 06:38:49,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:38:49,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:38:49,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:49,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:38:49,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:38:49,760 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-23 06:38:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:38:50,155 INFO L93 Difference]: Finished difference Result 238 states and 255 transitions. [2022-07-23 06:38:50,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 06:38:50,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-23 06:38:50,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:38:50,157 INFO L225 Difference]: With dead ends: 238 [2022-07-23 06:38:50,157 INFO L226 Difference]: Without dead ends: 238 [2022-07-23 06:38:50,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-07-23 06:38:50,157 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 374 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 06:38:50,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 505 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 06:38:50,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-23 06:38:50,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 114. [2022-07-23 06:38:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.183673469387755) internal successors, (116), 109 states have internal predecessors, (116), 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-23 06:38:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2022-07-23 06:38:50,160 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 66 [2022-07-23 06:38:50,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:38:50,160 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2022-07-23 06:38:50,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 10 states have internal predecessors, (71), 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-23 06:38:50,160 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-07-23 06:38:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-23 06:38:50,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:38:50,161 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-23 06:38:50,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-23 06:38:50,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:38:50,375 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-23 06:38:50,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:38:50,375 INFO L85 PathProgramCache]: Analyzing trace with hash 2119617500, now seen corresponding path program 1 times [2022-07-23 06:38:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:38:50,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [336947743] [2022-07-23 06:38:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:38:50,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:38:50,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:38:50,378 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-23 06:38:50,380 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-23 06:38:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:38:50,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-23 06:38:50,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:38:51,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:51,795 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-23 06:38:52,239 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-23 06:38:52,242 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-23 06:38:52,414 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-23 06:38:52,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:38:53,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:53,666 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-23 06:38:53,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:53,694 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-23 06:38:55,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:38:55,297 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-23 06:38:55,502 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-23 06:38:55,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:38:55,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [336947743] [2022-07-23 06:38:55,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [336947743] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:38:55,502 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:38:55,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 18] total 43 [2022-07-23 06:38:55,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574778490] [2022-07-23 06:38:55,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:38:55,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-23 06:38:55,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:38:55,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-23 06:38:55,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1661, Unknown=0, NotChecked=0, Total=1806 [2022-07-23 06:38:55,504 INFO L87 Difference]: Start difference. First operand 114 states and 120 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-23 06:39:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:02,291 INFO L93 Difference]: Finished difference Result 199 states and 207 transitions. [2022-07-23 06:39:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-23 06:39:02,291 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-23 06:39:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:02,292 INFO L225 Difference]: With dead ends: 199 [2022-07-23 06:39:02,292 INFO L226 Difference]: Without dead ends: 199 [2022-07-23 06:39:02,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=867, Invalid=4985, Unknown=0, NotChecked=0, Total=5852 [2022-07-23 06:39:02,293 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 1513 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:02,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 682 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1110 Invalid, 0 Unknown, 73 Unchecked, 2.4s Time] [2022-07-23 06:39:02,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-07-23 06:39:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 111. [2022-07-23 06:39:02,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 95 states have (on average 1.168421052631579) internal successors, (111), 106 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-23 06:39:02,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2022-07-23 06:39:02,295 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 67 [2022-07-23 06:39:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:02,295 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-07-23 06:39:02,295 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-23 06:39:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-07-23 06:39:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 06:39:02,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:02,296 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 06:39:02,319 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-23 06:39:02,503 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-23 06:39:02,503 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-23 06:39:02,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 768775417, now seen corresponding path program 2 times [2022-07-23 06:39:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:39:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932417759] [2022-07-23 06:39:02,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 06:39:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:39:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:39:02,512 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-23 06:39:02,567 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-23 06:39:02,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 06:39:02,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 06:39:02,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 06:39:02,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 06:39:02,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:03,110 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 06:39:03,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:39:03,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932417759] [2022-07-23 06:39:03,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932417759] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 06:39:03,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:39:03,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-23 06:39:03,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787481673] [2022-07-23 06:39:03,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:03,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 06:39:03,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:39:03,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 06:39:03,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-23 06:39:03,112 INFO L87 Difference]: Start difference. First operand 111 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-23 06:39:03,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:03,180 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-07-23 06:39:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 06:39:03,181 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 68 [2022-07-23 06:39:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:03,182 INFO L225 Difference]: With dead ends: 86 [2022-07-23 06:39:03,182 INFO L226 Difference]: Without dead ends: 86 [2022-07-23 06:39:03,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 126 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-23 06:39:03,182 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 206 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:03,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 214 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 06:39:03,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-23 06:39:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-07-23 06:39:03,184 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-23 06:39:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2022-07-23 06:39:03,185 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 68 [2022-07-23 06:39:03,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:03,185 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2022-07-23 06:39:03,185 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-23 06:39:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2022-07-23 06:39:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-23 06:39:03,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:03,186 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-23 06:39:03,197 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-23 06:39:03,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:39:03,395 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-23 06:39:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:03,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1139341665, now seen corresponding path program 1 times [2022-07-23 06:39:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:39:03,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683648836] [2022-07-23 06:39:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:03,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:39:03,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:39:03,397 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:39:03,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-23 06:39:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:03,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-23 06:39:03,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:03,899 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 06:39:03,899 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-23 06:39:04,012 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-23 06:39:04,187 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 06:39:04,187 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-23 06:39:04,334 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-23 06:39:04,528 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:04,528 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-23 06:39:04,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:04,915 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-23 06:39:05,326 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:05,326 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-23 06:39:05,911 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-23 06:39:06,115 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-23 06:39:06,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:06,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2075 (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_2075) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:06,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2075 (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_2075) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:06,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2075 (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_2075) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:07,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2073 (_ 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_2073)) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2075)) |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-23 06:39:07,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2073 (_ BitVec 32)) (v_ArrVal_2072 (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_2072))) (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_2073)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2075))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:07,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2073 (_ BitVec 32)) (v_ArrVal_2072 (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_2072))) (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_2073)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2075))) |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-23 06:39:07,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:07,774 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-23 06:39:07,778 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-23 06:39:07,785 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 22 [2022-07-23 06:39:07,788 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 46 treesize of output 42 [2022-07-23 06:39:08,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 06:39:08,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683648836] [2022-07-23 06:39:08,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683648836] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:08,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [172105695] [2022-07-23 06:39:08,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:08,320 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-23 06:39:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-23 06:39:08,321 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-23 06:39:08,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2022-07-23 06:39:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:08,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-23 06:39:08,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:08,812 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-23 06:39:09,356 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-23 06:39:09,455 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:39:09,455 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-23 06:39:09,772 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-23 06:39:10,121 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:10,121 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-23 06:39:10,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:10,855 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-23 06:39:11,303 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 06:39:11,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-23 06:39:12,070 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-23 06:39:12,093 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-23 06:39:12,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:12,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (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_2134) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:12,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (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_2134) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:12,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (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_2134) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:12,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (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_2134) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:12,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ 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_2132)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2134)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:12,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ 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_2132)) (select .cse0 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2134)) |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-23 06:39:12,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32))) (bvult (select (select (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (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_2132)) (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2134)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-23 06:39:13,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2132 (_ BitVec 32))) (bvult (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2131))) (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_2132)) (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2134))) |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-23 06:39:13,166 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:13,166 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-23 06:39:13,170 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-23 06:39:13,174 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-23 06:39:13,181 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-23 06:39:13,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [172105695] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 06:39:13,616 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 06:39:13,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2022-07-23 06:39:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610576371] [2022-07-23 06:39:13,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 06:39:13,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 06:39:13,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 06:39:13,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 06:39:13,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2490, Unknown=108, NotChecked=1610, Total=4422 [2022-07-23 06:39:13,617 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-23 06:39:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 06:39:20,645 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2022-07-23 06:39:20,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 06:39:20,646 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-23 06:39:20,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 06:39:20,647 INFO L225 Difference]: With dead ends: 106 [2022-07-23 06:39:20,647 INFO L226 Difference]: Without dead ends: 106 [2022-07-23 06:39:20,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=528, Invalid=4822, Unknown=108, NotChecked=2198, Total=7656 [2022-07-23 06:39:20,648 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 281 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-23 06:39:20,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 660 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-23 06:39:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-23 06:39:20,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 87. [2022-07-23 06:39:20,649 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-23 06:39:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-07-23 06:39:20,649 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 69 [2022-07-23 06:39:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 06:39:20,650 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-07-23 06:39:20,650 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-23 06:39:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-07-23 06:39:20,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-23 06:39:20,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 06:39:20,650 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-23 06:39:20,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:20,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Forceful destruction successful, exit code 0 [2022-07-23 06:39:21,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 06:39:21,051 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-23 06:39:21,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 06:39:21,051 INFO L85 PathProgramCache]: Analyzing trace with hash -998839710, now seen corresponding path program 1 times [2022-07-23 06:39:21,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 06:39:21,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145240082] [2022-07-23 06:39:21,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 06:39:21,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 06:39:21,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 06:39:21,053 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 06:39:21,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-23 06:39:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 06:39:21,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-23 06:39:21,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 06:39:21,490 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-23 06:39:21,684 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 06:39:21,685 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-23 06:39:21,772 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-23 06:39:21,894 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-23 06:39:21,895 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-23 06:39:21,899 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-23 06:39:22,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:22,207 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-23 06:39:22,207 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-23 06:39:22,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, 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-23 06:39:22,541 INFO L356 Elim1Store]: treesize reduction 62, result has 28.7 percent of original size [2022-07-23 06:39:22,541 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-23 06:39:22,569 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-23 06:39:22,569 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-23 06:39:23,622 INFO L356 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2022-07-23 06:39:23,622 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-23 06:39:23,639 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:23,639 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-23 06:39:23,991 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-23 06:39:23,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 06:39:39,872 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32))) (or (forall ((v_ArrVal_2200 (_ BitVec 32))) (= (select (let ((.cse0 (let ((.cse1 (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_2196)))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2197) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2200)))))) (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_2201 (_ BitVec 32))) (not (= (select (select (let ((.cse4 (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_2196)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2197))) (store .cse3 .cse4 (store (select .cse3 .cse4) (bvadd (_ bv4 32) (select (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2201))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))))) (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2201 (_ BitVec 32))) (or (forall ((v_ArrVal_2200 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2197)) (.cse8 (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_2196)))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse7 (bvadd (_ bv4 32) (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (select (store .cse5 .cse6 (store (select .cse5 .cse6) .cse7 v_ArrVal_2201)) (select (select (store .cse8 .cse6 (store (select .cse8 .cse6) .cse7 v_ArrVal_2200)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32)))) (not (= (select (select (let ((.cse10 (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_2196)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2197))) (store .cse9 .cse10 (store (select .cse9 .cse10) (bvadd (_ bv4 32) (select (select .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2201))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-23 06:39:39,991 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32))) (or (forall ((v_ArrVal_2200 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.base| (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_2196))) (.cse2 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2200)))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (_ bv0 32)))) (forall ((v_ArrVal_2201 (_ BitVec 32))) (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2197)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse4 .cse5 (store (select .cse4 .cse5) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2201))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))))) (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2201 (_ BitVec 32))) (or (forall ((v_ArrVal_2200 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse10 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse7 (select .cse10 |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse8 (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_main_~s~0#1.offset|)))) (select (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2197))) (store .cse6 .cse7 (store (select .cse6 .cse7) .cse8 v_ArrVal_2201))) (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse10 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2196)))) (store .cse9 .cse7 (store (select .cse9 .cse7) .cse8 v_ArrVal_2200))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (_ bv0 32)))) (not (= (select (select (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2197)) (.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store .cse11 .cse12 (store (select .cse11 .cse12) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_main_~s~0#1.offset|)) v_ArrVal_2201))) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))))) is different from false [2022-07-23 06:39:40,075 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2201 (_ BitVec 32))) (or (forall ((v_ArrVal_2200 (_ 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_2197 |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_2197))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_2201))) (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_2196)))) (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_2200))) |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|)) (not (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2197)) (.cse6 (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 .cse5 .cse6 (store (select .cse5 .cse6) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) v_ArrVal_2201))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv0 32))))) (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32))) (or (forall ((v_ArrVal_2201 (_ BitVec 32))) (not (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_2197)) (.cse8 (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 .cse7 .cse8 (store (select .cse7 .cse8) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) v_ArrVal_2201))) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (_ bv0 32)))) (forall ((v_ArrVal_2200 (_ BitVec 32))) (= (select (let ((.cse9 (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base| (store .cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2196))) (.cse11 (select .cse12 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (store .cse10 .cse11 (store (select .cse10 .cse11) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) v_ArrVal_2200)))))) (select .cse9 (select (select .cse9 |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|))))) is different from false [2022-07-23 06:39:40,153 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2201 (_ BitVec 32))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2197)) (.cse1 (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 .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_2201))) |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_2200 (_ BitVec 32))) (= (select (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (select (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2197))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_2201))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse6 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196)))) (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 v_ArrVal_2200))) |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|)))) (forall ((v_ArrVal_2197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2196 (_ BitVec 32))) (or (forall ((v_ArrVal_2201 (_ BitVec 32))) (not (= (select (select (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_2197)) (.cse8 (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 .cse7 .cse8 (store (select .cse7 .cse8) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_2201))) |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_2200 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse9 (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse12 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196))) (.cse11 (select .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse10 .cse11 (store (select .cse10 .cse11) (bvadd (_ bv4 32) (select v_ArrVal_2197 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) v_ArrVal_2200)))))) (select .cse9 (select (select .cse9 |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-23 06:39:40,206 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:40,206 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 224 treesize of output 200 [2022-07-23 06:39:40,331 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:40,331 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 2668 treesize of output 2574 [2022-07-23 06:39:40,374 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:40,374 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 2619 treesize of output 2537 [2022-07-23 06:39:40,438 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-23 06:39:40,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:40,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:40,870 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 846 treesize of output 848 [2022-07-23 06:39:41,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 06:39:41,336 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 824 treesize of output 820 [2022-07-23 06:39:41,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:41,624 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 1993 treesize of output 1989 [2022-07-23 06:39:43,271 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:43,271 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 66 treesize of output 59 [2022-07-23 06:39:43,337 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:43,337 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 163 treesize of output 167 [2022-07-23 06:39:43,344 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 343 treesize of output 327 [2022-07-23 06:39:43,390 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-23 06:39:43,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 06:39:43,450 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 179 treesize of output 183 [2022-07-23 06:39:45,601 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse30 (= (select (select (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|)) |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_~head~0#1.base|))) (let ((.cse11 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| (_ bv0 32))) (.cse5 (not .cse30)) (.cse13 (= (_ bv0 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse12 (and (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse43 (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 ((.cse42 (select .cse43 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse40 (store .cse43 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse42 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196))) (.cse41 (select .cse42 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse40 .cse41 (store (select .cse40 .cse41) (_ bv4 32) v_ArrVal_2200))))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (not (let ((.cse46 (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 ((.cse47 (select .cse46 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse44 (select .cse47 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse44 (select (select (let ((.cse45 (store .cse46 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse47 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196)))) (store .cse45 .cse44 (store (select .cse45 .cse44) (_ bv4 32) v_ArrVal_2200))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))))))) (and (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (= (select (let ((.cse0 (let ((.cse4 (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 ((.cse3 (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse1 (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_2196))) (.cse2 (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse1 .cse2 (store (select .cse1 .cse2) (_ bv4 32) v_ArrVal_2200))))))) (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)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (or .cse5 (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (let ((.cse6 (let ((.cse10 (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 ((.cse9 (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse7 (store .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196))) (.cse8 (select .cse9 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_2200))))))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (_ bv0 32))))) (or (and .cse11 (or .cse5 .cse12)) .cse13) (or .cse5 (and (or .cse13 (and (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (not (let ((.cse16 (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 ((.cse17 (select .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse14 (select .cse17 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse14 (select (select (let ((.cse15 (store .cse16 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse17 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196)))) (store .cse15 .cse14 (store (select .cse15 .cse14) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_2200))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (let ((.cse21 (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 ((.cse20 (select .cse21 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse18 (store .cse21 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse20 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196))) (.cse19 (select .cse20 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse18 .cse19 (store (select .cse18 .cse19) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_2200))))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) (or (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (let ((.cse24 (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 ((.cse25 (select .cse24 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse22 (select .cse25 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse22 (select (select (let ((.cse23 (store .cse24 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse25 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196)))) (store .cse23 .cse22 (store (select .cse23 .cse22) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_2200))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))))) .cse11) (or .cse13 .cse12))) (or .cse5 .cse13 (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse29 (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 ((.cse28 (select .cse29 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse26 (store .cse29 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse28 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196))) (.cse27 (select .cse28 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse26 .cse27 (store (select .cse26 .cse27) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| v_ArrVal_2200))))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (or .cse11 .cse30) (or (forall ((v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse34 (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 ((.cse33 (select .cse34 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse31 (store .cse34 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse33 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196))) (.cse32 (select .cse33 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse31 .cse32 (store (select .cse31 .cse32) (_ bv4 32) v_ArrVal_2200))))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and .cse13 .cse30)) (or .cse5 .cse13 .cse12) (forall ((v_arrayElimCell_255 (_ BitVec 32)) (v_ArrVal_2196 (_ BitVec 32)) (v_ArrVal_2200 (_ BitVec 32))) (let ((.cse38 (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 ((.cse39 (select .cse38 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (let ((.cse36 (select .cse39 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse35 (select (select (let ((.cse37 (store .cse38 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (store .cse39 (bvadd (_ bv4 32) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2196)))) (store .cse37 .cse36 (store (select .cse37 .cse36) (bvadd v_arrayElimCell_255 (_ bv4 32)) v_ArrVal_2200))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (= .cse35 .cse36) (= .cse35 |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))))))))) is different from false