./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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_insert_equal.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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:16:14,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:16:14,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:16:14,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:16:14,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:16:14,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:16:14,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:16:14,375 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:16:14,377 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:16:14,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:16:14,382 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:16:14,384 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:16:14,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:16:14,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:16:14,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:16:14,389 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:16:14,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:16:14,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:16:14,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:16:14,398 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:16:14,400 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:16:14,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:16:14,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:16:14,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:16:14,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:16:14,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:16:14,411 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:16:14,411 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:16:14,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:16:14,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:16:14,414 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:16:14,414 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:16:14,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:16:14,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:16:14,417 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:16:14,418 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:16:14,418 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:16:14,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:16:14,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:16:14,419 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:16:14,419 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:16:14,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:16:14,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:16:14,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:16:14,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:16:14,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:16:14,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:16:14,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:16:14,453 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:16:14,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:16:14,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:16:14,454 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:16:14,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:16:14,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:16:14,455 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:16:14,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:16:14,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:16:14,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:16:14,456 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:16:14,456 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:16:14,456 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:16:14,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:16:14,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:16:14,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:16:14,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:16:14,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:16:14,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:16:14,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:16:14,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:14,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:16:14,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:16:14,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:16:14,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:16:14,459 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-07-12 19:16:14,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:16:14,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:16:14,741 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:16:14,742 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:16:14,743 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:16:14,744 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-07-12 19:16:14,828 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca7718c69/68ee3c238666474d89ad3467157b0799/FLAGaa13bf753 [2022-07-12 19:16:15,278 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:16:15,283 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-07-12 19:16:15,294 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca7718c69/68ee3c238666474d89ad3467157b0799/FLAGaa13bf753 [2022-07-12 19:16:15,617 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca7718c69/68ee3c238666474d89ad3467157b0799 [2022-07-12 19:16:15,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:16:15,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:16:15,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:15,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:16:15,625 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:16:15,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:15" (1/1) ... [2022-07-12 19:16:15,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7af6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:15, skipping insertion in model container [2022-07-12 19:16:15,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:15" (1/1) ... [2022-07-12 19:16:15,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:16:15,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:16:15,952 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_insert_equal.i[24601,24614] [2022-07-12 19:16:15,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:15,969 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:16:16,037 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_insert_equal.i[24601,24614] [2022-07-12 19:16:16,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:16,066 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:16:16,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16 WrapperNode [2022-07-12 19:16:16,067 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:16,068 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:16,068 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:16:16,068 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:16:16,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,107 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,145 INFO L137 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2022-07-12 19:16:16,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:16,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:16:16,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:16:16,148 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:16:16,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,174 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,196 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,200 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:16:16,214 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:16:16,214 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:16:16,215 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:16:16,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (1/1) ... [2022-07-12 19:16:16,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:16,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:16,248 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-12 19:16:16,263 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-12 19:16:16,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:16:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:16:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:16:16,302 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:16:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:16:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:16:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:16:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:16:16,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:16:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:16:16,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:16:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:16:16,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:16:16,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:16:16,395 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:16:16,400 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:16:16,739 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:16:16,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:16:16,746 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 19:16:16,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:16 BoogieIcfgContainer [2022-07-12 19:16:16,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:16:16,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:16:16,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:16:16,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:16:16,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:16:15" (1/3) ... [2022-07-12 19:16:16,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114c64d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:16, skipping insertion in model container [2022-07-12 19:16:16,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:16" (2/3) ... [2022-07-12 19:16:16,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114c64d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:16, skipping insertion in model container [2022-07-12 19:16:16,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:16" (3/3) ... [2022-07-12 19:16:16,761 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-07-12 19:16:16,774 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:16:16,774 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-07-12 19:16:16,818 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:16:16,824 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@72739f2d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1c334ed3 [2022-07-12 19:16:16,824 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-07-12 19:16:16,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 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-12 19:16:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:16,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:16,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:16,836 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:16,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash 895367701, now seen corresponding path program 1 times [2022-07-12 19:16:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:16,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379997928] [2022-07-12 19:16:16,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:16,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,033 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-12 19:16:17,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:17,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379997928] [2022-07-12 19:16:17,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379997928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:17,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:17,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205316418] [2022-07-12 19:16:17,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:17,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:17,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:17,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:17,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:17,076 INFO L87 Difference]: Start difference. First operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:17,189 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-07-12 19:16:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:17,191 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-12 19:16:17,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:17,205 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:16:17,205 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 19:16:17,207 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-12 19:16:17,211 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:17,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 19:16:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-12 19:16:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 111 states have internal predecessors, (119), 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-12 19:16:17,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-07-12 19:16:17,245 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 6 [2022-07-12 19:16:17,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:17,245 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-07-12 19:16:17,245 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-12 19:16:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-07-12 19:16:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:17,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:17,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:17,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:16:17,247 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash 895367702, now seen corresponding path program 1 times [2022-07-12 19:16:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091422] [2022-07-12 19:16:17,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,299 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-12 19:16:17,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:17,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091422] [2022-07-12 19:16:17,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:17,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:17,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444338913] [2022-07-12 19:16:17,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:17,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:17,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:17,304 INFO L87 Difference]: Start difference. First operand 116 states and 125 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-12 19:16:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:17,380 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-07-12 19:16:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:17,381 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-12 19:16:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:17,382 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:16:17,382 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:16:17,383 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-12 19:16:17,384 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:17,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:16:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-12 19:16:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 109 states have internal predecessors, (117), 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-12 19:16:17,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-07-12 19:16:17,394 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 6 [2022-07-12 19:16:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:17,394 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-07-12 19:16:17,394 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-12 19:16:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-07-12 19:16:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:16:17,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:17,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:17,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:16:17,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1575141079, now seen corresponding path program 1 times [2022-07-12 19:16:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:17,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793349762] [2022-07-12 19:16:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:17,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,502 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-12 19:16:17,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:17,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793349762] [2022-07-12 19:16:17,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793349762] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:17,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:17,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:16:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54879295] [2022-07-12 19:16:17,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:17,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:16:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:17,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:16:17,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:17,506 INFO L87 Difference]: Start difference. First operand 114 states and 123 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-12 19:16:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:17,602 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-07-12 19:16:17,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:17,604 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-12 19:16:17,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:17,609 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:16:17,610 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:16:17,610 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-12 19:16:17,616 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 5 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:17,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 284 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:17,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:16:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2022-07-12 19:16:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 110 states have internal predecessors, (118), 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-12 19:16:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-07-12 19:16:17,637 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 13 [2022-07-12 19:16:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:17,638 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-07-12 19:16:17,638 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-12 19:16:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-07-12 19:16:17,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:17,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:17,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:17,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:16:17,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:17,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:17,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086820, now seen corresponding path program 1 times [2022-07-12 19:16:17,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:17,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193766196] [2022-07-12 19:16:17,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:17,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:17,770 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-12 19:16:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:17,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193766196] [2022-07-12 19:16:17,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193766196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:17,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:17,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:17,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360485131] [2022-07-12 19:16:17,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:17,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:17,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:17,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:17,773 INFO L87 Difference]: Start difference. First operand 115 states and 124 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-12 19:16:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:18,008 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-07-12 19:16:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:18,009 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-12 19:16:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:18,012 INFO L225 Difference]: With dead ends: 115 [2022-07-12 19:16:18,012 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 19:16:18,013 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-12 19:16:18,021 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 13 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:18,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 405 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:18,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 19:16:18,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-07-12 19:16:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 109 states have internal predecessors, (117), 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-12 19:16:18,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-07-12 19:16:18,037 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 22 [2022-07-12 19:16:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:18,037 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-07-12 19:16:18,038 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-12 19:16:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-07-12 19:16:18,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:18,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:18,039 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:18,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:16:18,040 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:18,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:18,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086819, now seen corresponding path program 1 times [2022-07-12 19:16:18,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:18,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725236861] [2022-07-12 19:16:18,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,232 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-12 19:16:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:18,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725236861] [2022-07-12 19:16:18,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725236861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:18,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:18,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956871980] [2022-07-12 19:16:18,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:18,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:18,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:18,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:18,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:18,236 INFO L87 Difference]: Start difference. First operand 114 states and 123 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-12 19:16:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:18,446 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-07-12 19:16:18,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:18,447 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-12 19:16:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:18,448 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:16:18,448 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:16:18,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:18,449 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:18,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 429 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:16:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-07-12 19:16:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 108 states have internal predecessors, (116), 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-12 19:16:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-07-12 19:16:18,456 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 22 [2022-07-12 19:16:18,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:18,456 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-07-12 19:16:18,457 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-12 19:16:18,457 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-07-12 19:16:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:18,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:18,458 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-12 19:16:18,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:16:18,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:18,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:18,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578181, now seen corresponding path program 1 times [2022-07-12 19:16:18,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:18,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062079668] [2022-07-12 19:16:18,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:18,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,608 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-12 19:16:18,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:18,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062079668] [2022-07-12 19:16:18,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062079668] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:18,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624458283] [2022-07-12 19:16:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:18,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:18,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:18,615 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-12 19:16:18,623 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-12 19:16:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:18,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 19:16:18,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:18,796 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-12 19:16:18,920 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:16:18,920 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-12 19:16:18,975 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-12 19:16:18,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:19,330 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-12 19:16:19,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624458283] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:19,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:16:19,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-07-12 19:16:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130723279] [2022-07-12 19:16:19,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:19,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:16:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:19,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:16:19,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:16:19,334 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:19,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:19,565 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-07-12 19:16:19,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:19,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-07-12 19:16:19,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:19,566 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:16:19,566 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:16:19,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:16:19,567 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 35 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:19,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 647 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 335 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2022-07-12 19:16:19,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:16:19,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 19:16:19,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 113 states have internal predecessors, (121), 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-12 19:16:19,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2022-07-12 19:16:19,573 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 25 [2022-07-12 19:16:19,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:19,573 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2022-07-12 19:16:19,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:19,573 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-07-12 19:16:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:19,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:19,574 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-12 19:16:19,602 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-12 19:16:19,795 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-12 19:16:19,796 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578182, now seen corresponding path program 1 times [2022-07-12 19:16:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:19,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728775576] [2022-07-12 19:16:19,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:19,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:19,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:19,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:20,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:20,073 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-12 19:16:20,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:20,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728775576] [2022-07-12 19:16:20,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728775576] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:20,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332830401] [2022-07-12 19:16:20,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:20,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:20,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:20,075 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-12 19:16:20,102 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-12 19:16:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:20,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-12 19:16:20,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:20,191 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-12 19:16:20,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:20,470 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-12 19:16:20,478 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:20,478 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-12 19:16:20,514 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-12 19:16:20,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:22,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332830401] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:22,652 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:22,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-12 19:16:22,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636318827] [2022-07-12 19:16:22,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:22,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 19:16:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:22,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 19:16:22,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:16:22,654 INFO L87 Difference]: Start difference. First operand 119 states and 127 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-12 19:16:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:23,160 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-07-12 19:16:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:16:23,161 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-12 19:16:23,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:23,161 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:16:23,162 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:16:23,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-07-12 19:16:23,163 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 116 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:23,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 690 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 788 Invalid, 0 Unknown, 49 Unchecked, 0.4s Time] [2022-07-12 19:16:23,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:16:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2022-07-12 19:16:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 112 states have internal predecessors, (120), 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-12 19:16:23,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2022-07-12 19:16:23,167 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 25 [2022-07-12 19:16:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:23,168 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2022-07-12 19:16:23,168 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-12 19:16:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2022-07-12 19:16:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:23,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:23,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:23,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 19:16:23,369 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-12 19:16:23,370 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:23,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash 131514271, now seen corresponding path program 1 times [2022-07-12 19:16:23,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:23,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995676009] [2022-07-12 19:16:23,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:23,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:23,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:23,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:23,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:23,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995676009] [2022-07-12 19:16:23,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995676009] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096181389] [2022-07-12 19:16:23,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:23,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:23,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:23,627 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-12 19:16:23,629 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-12 19:16:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:23,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:16:23,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:23,758 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-12 19:16:23,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 5 treesize of output 3 [2022-07-12 19:16:23,868 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-12 19:16:24,006 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:24,006 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 14 [2022-07-12 19:16:24,019 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:24,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:24,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096181389] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:24,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:24,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-07-12 19:16:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710033908] [2022-07-12 19:16:24,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:24,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:16:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:24,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:16:24,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:16:24,212 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:24,523 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2022-07-12 19:16:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:24,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-12 19:16:24,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:24,525 INFO L225 Difference]: With dead ends: 143 [2022-07-12 19:16:24,525 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 19:16:24,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:16:24,526 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 130 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:24,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 381 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 317 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2022-07-12 19:16:24,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 19:16:24,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 123. [2022-07-12 19:16:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 115 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2022-07-12 19:16:24,532 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 37 [2022-07-12 19:16:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:24,532 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2022-07-12 19:16:24,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2022-07-12 19:16:24,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:24,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:24,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:24,562 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-12 19:16:24,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:24,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash 131514272, now seen corresponding path program 1 times [2022-07-12 19:16:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:24,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604481525] [2022-07-12 19:16:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:24,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:24,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:25,022 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:25,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604481525] [2022-07-12 19:16:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604481525] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440724340] [2022-07-12 19:16:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:25,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:25,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:25,028 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-12 19:16:25,030 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-12 19:16:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:25,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:16:25,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:25,187 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-12 19:16:25,212 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-12 19:16:25,318 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 19:16:25,346 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-12 19:16:25,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:25,519 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: line 64731 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-12 19:16:25,523 INFO L158 Benchmark]: Toolchain (without parser) took 9902.35ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 79.9MB in the beginning and 45.6MB in the end (delta: 34.3MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2022-07-12 19:16:25,523 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 88.1MB. Free memory was 61.3MB in the beginning and 61.2MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:16:25,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 445.16ms. Allocated memory is still 115.3MB. Free memory was 79.7MB in the beginning and 82.6MB in the end (delta: -2.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 19:16:25,524 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.07ms. Allocated memory is still 115.3MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:16:25,524 INFO L158 Benchmark]: Boogie Preprocessor took 66.08ms. Allocated memory is still 115.3MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:16:25,524 INFO L158 Benchmark]: RCFGBuilder took 533.95ms. Allocated memory is still 115.3MB. Free memory was 78.4MB in the beginning and 58.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-12 19:16:25,524 INFO L158 Benchmark]: TraceAbstraction took 8772.66ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 57.4MB in the beginning and 45.6MB in the end (delta: 11.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2022-07-12 19:16:25,526 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.25ms. Allocated memory is still 88.1MB. Free memory was 61.3MB in the beginning and 61.2MB in the end (delta: 24.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 445.16ms. Allocated memory is still 115.3MB. Free memory was 79.7MB in the beginning and 82.6MB in the end (delta: -2.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.07ms. Allocated memory is still 115.3MB. Free memory was 82.6MB in the beginning and 80.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.08ms. Allocated memory is still 115.3MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 533.95ms. Allocated memory is still 115.3MB. Free memory was 78.4MB in the beginning and 58.0MB in the end (delta: 20.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8772.66ms. Allocated memory was 115.3MB in the beginning and 138.4MB in the end (delta: 23.1MB). Free memory was 57.4MB in the beginning and 45.6MB in the end (delta: 11.8MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: line 64731 column 46: unknown constant v_#length_BEFORE_CALL_4 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: line 64731 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-12 19:16:25,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 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_insert_equal.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 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:16:27,570 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:16:27,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:16:27,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:16:27,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:16:27,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:16:27,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:16:27,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:16:27,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:16:27,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:16:27,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:16:27,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:16:27,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:16:27,653 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:16:27,654 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:16:27,657 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:16:27,658 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:16:27,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:16:27,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:16:27,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:16:27,669 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:16:27,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:16:27,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:16:27,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:16:27,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:16:27,682 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:16:27,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:16:27,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:16:27,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:16:27,684 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:16:27,685 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:16:27,685 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:16:27,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:16:27,688 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:16:27,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:16:27,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:16:27,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:16:27,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:16:27,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:16:27,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:16:27,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:16:27,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:16:27,699 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:16:27,735 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:16:27,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:16:27,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:16:27,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:16:27,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:16:27,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:16:27,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:16:27,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:16:27,743 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:16:27,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:16:27,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:16:27,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:16:27,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:16:27,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:16:27,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:16:27,745 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:16:27,745 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:16:27,746 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:16:27,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:16:27,746 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:16:27,746 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:16:27,746 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:16:27,747 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:16:27,747 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:16:27,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:16:27,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:16:27,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:16:27,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:27,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:16:27,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:16:27,749 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:16:27,749 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:16:27,749 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:16:27,749 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2022-07-12 19:16:28,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:16:28,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:16:28,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:16:28,111 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:16:28,111 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:16:28,113 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-07-12 19:16:28,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba235371/02157c6571394606809192b37aab20f9/FLAGb85892e34 [2022-07-12 19:16:28,720 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:16:28,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2022-07-12 19:16:28,730 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba235371/02157c6571394606809192b37aab20f9/FLAGb85892e34 [2022-07-12 19:16:29,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ba235371/02157c6571394606809192b37aab20f9 [2022-07-12 19:16:29,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:16:29,047 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:16:29,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:29,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:16:29,054 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:16:29,055 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72daa0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29, skipping insertion in model container [2022-07-12 19:16:29,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:16:29,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:16:29,460 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_insert_equal.i[24601,24614] [2022-07-12 19:16:29,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:29,483 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:16:29,543 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_insert_equal.i[24601,24614] [2022-07-12 19:16:29,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:16:29,581 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:16:29,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29 WrapperNode [2022-07-12 19:16:29,582 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:16:29,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:29,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:16:29,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:16:29,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,651 INFO L137 Inliner]: procedures = 130, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 148 [2022-07-12 19:16:29,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:16:29,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:16:29,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:16:29,653 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:16:29,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,681 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,689 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:16:29,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:16:29,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:16:29,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:16:29,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (1/1) ... [2022-07-12 19:16:29,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:16:29,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:29,745 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-12 19:16:29,770 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-12 19:16:29,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:16:29,787 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:16:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:16:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:16:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:16:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:16:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:16:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:16:29,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:16:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:16:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:16:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:16:29,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:16:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:16:29,984 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:16:29,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:16:30,567 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:16:30,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:16:30,574 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-12 19:16:30,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:30 BoogieIcfgContainer [2022-07-12 19:16:30,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:16:30,577 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:16:30,577 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:16:30,580 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:16:30,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:16:29" (1/3) ... [2022-07-12 19:16:30,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8e7bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:30, skipping insertion in model container [2022-07-12 19:16:30,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:16:29" (2/3) ... [2022-07-12 19:16:30,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8e7bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:30, skipping insertion in model container [2022-07-12 19:16:30,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:30" (3/3) ... [2022-07-12 19:16:30,583 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2022-07-12 19:16:30,596 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:16:30,596 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-07-12 19:16:30,646 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:16:30,652 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@484a90f8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14dbdbef [2022-07-12 19:16:30,653 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-07-12 19:16:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 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-12 19:16:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:30,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:30,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:30,665 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:30,672 INFO L85 PathProgramCache]: Analyzing trace with hash 895367701, now seen corresponding path program 1 times [2022-07-12 19:16:30,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:30,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53628221] [2022-07-12 19:16:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:30,686 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:30,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:30,693 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-12 19:16:30,696 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-12 19:16:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:16:30,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:30,859 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-12 19:16:30,888 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-12 19:16:30,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:30,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:30,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53628221] [2022-07-12 19:16:30,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53628221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:30,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:30,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808713517] [2022-07-12 19:16:30,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:30,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:30,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:30,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:30,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:30,936 INFO L87 Difference]: Start difference. First operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:31,185 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-07-12 19:16:31,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:31,189 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-12 19:16:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:31,197 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:16:31,198 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 19:16:31,199 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-12 19:16:31,204 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:31,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:31,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 19:16:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-12 19:16:31,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 111 states have internal predecessors, (119), 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-12 19:16:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-07-12 19:16:31,256 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 6 [2022-07-12 19:16:31,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:31,257 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-07-12 19:16:31,257 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-12 19:16:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-07-12 19:16:31,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:31,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:31,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:31,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 19:16:31,468 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-12 19:16:31,468 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:31,469 INFO L85 PathProgramCache]: Analyzing trace with hash 895367702, now seen corresponding path program 1 times [2022-07-12 19:16:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:31,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16886690] [2022-07-12 19:16:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:31,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:31,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:31,476 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-12 19:16:31,478 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-12 19:16:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:31,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:16:31,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:31,546 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-12 19:16:31,561 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-12 19:16:31,561 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:31,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:31,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16886690] [2022-07-12 19:16:31,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16886690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:31,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:31,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:31,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638391416] [2022-07-12 19:16:31,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:31,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:31,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:31,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:31,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:31,565 INFO L87 Difference]: Start difference. First operand 116 states and 125 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-12 19:16:31,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:31,813 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-07-12 19:16:31,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:31,815 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-12 19:16:31,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:31,816 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:16:31,816 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:16:31,816 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-12 19:16:31,818 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:31,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:16:31,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-07-12 19:16:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 109 states have internal predecessors, (117), 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-12 19:16:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-07-12 19:16:31,826 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 6 [2022-07-12 19:16:31,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:31,827 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-07-12 19:16:31,827 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-12 19:16:31,827 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-07-12 19:16:31,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:16:31,828 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:31,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:31,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-12 19:16:32,037 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-12 19:16:32,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:32,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1575141079, now seen corresponding path program 1 times [2022-07-12 19:16:32,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:32,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966793554] [2022-07-12 19:16:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:32,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:32,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:32,047 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-12 19:16:32,048 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-12 19:16:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:32,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:16:32,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:32,164 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-12 19:16:32,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:32,165 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:32,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966793554] [2022-07-12 19:16:32,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966793554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:32,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:32,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:16:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432416878] [2022-07-12 19:16:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:32,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:32,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:32,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:32,168 INFO L87 Difference]: Start difference. First operand 114 states and 123 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-12 19:16:32,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:32,186 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-07-12 19:16:32,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:32,186 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-12 19:16:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:32,187 INFO L225 Difference]: With dead ends: 121 [2022-07-12 19:16:32,197 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 19:16:32,198 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-12 19:16:32,199 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 5 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 239 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-12 19:16:32,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 239 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:32,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 19:16:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2022-07-12 19:16:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 110 states have internal predecessors, (118), 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-12 19:16:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-07-12 19:16:32,214 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 13 [2022-07-12 19:16:32,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:32,215 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-07-12 19:16:32,215 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-12 19:16:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-07-12 19:16:32,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:32,216 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:32,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:32,229 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-12 19:16:32,427 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-12 19:16:32,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:32,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086820, now seen corresponding path program 1 times [2022-07-12 19:16:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:32,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924222745] [2022-07-12 19:16:32,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:32,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:32,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:32,431 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-12 19:16:32,437 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-12 19:16:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:32,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:16:32,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:32,558 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-12 19:16:32,600 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-12 19:16:32,601 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:32,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:32,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924222745] [2022-07-12 19:16:32,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924222745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:32,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:32,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:16:32,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583748577] [2022-07-12 19:16:32,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:32,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:16:32,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:32,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:16:32,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:32,604 INFO L87 Difference]: Start difference. First operand 115 states and 124 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-12 19:16:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:33,046 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2022-07-12 19:16:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:16:33,047 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-12 19:16:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:33,049 INFO L225 Difference]: With dead ends: 115 [2022-07-12 19:16:33,049 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 19:16:33,050 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-12 19:16:33,050 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 12 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:33,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 364 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:16:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 19:16:33,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-07-12 19:16:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 109 states have internal predecessors, (117), 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-12 19:16:33,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-07-12 19:16:33,067 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 22 [2022-07-12 19:16:33,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:33,068 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-07-12 19:16:33,069 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-12 19:16:33,069 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-07-12 19:16:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:33,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:33,070 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:33,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:33,282 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-12 19:16:33,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:33,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:33,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086819, now seen corresponding path program 1 times [2022-07-12 19:16:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:33,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272325918] [2022-07-12 19:16:33,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:33,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:33,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:33,291 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-12 19:16:33,292 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-12 19:16:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:33,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:16:33,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:33,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-12 19:16:33,542 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-12 19:16:33,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:33,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:33,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272325918] [2022-07-12 19:16:33,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272325918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:33,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:33,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:16:33,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198437253] [2022-07-12 19:16:33,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:33,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:16:33,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:33,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:16:33,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:33,545 INFO L87 Difference]: Start difference. First operand 114 states and 123 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-12 19:16:33,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:33,960 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-07-12 19:16:33,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:16:33,961 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-12 19:16:33,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:33,962 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:16:33,962 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:16:33,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:33,963 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 11 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:33,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:16:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:16:33,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2022-07-12 19:16:33,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 108 states have internal predecessors, (116), 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-12 19:16:33,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-07-12 19:16:33,971 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 22 [2022-07-12 19:16:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:33,971 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-07-12 19:16:33,972 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-12 19:16:33,972 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-07-12 19:16:33,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:33,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:33,973 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-12 19:16:33,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 19:16:34,182 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-12 19:16:34,183 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:34,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578181, now seen corresponding path program 1 times [2022-07-12 19:16:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:34,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391163495] [2022-07-12 19:16:34,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:34,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:34,186 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-12 19:16:34,187 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-12 19:16:34,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:34,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:16:34,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:34,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:34,526 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:16:34,527 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-12 19:16:34,551 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-12 19:16:34,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:34,749 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-12 19:16:34,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:34,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391163495] [2022-07-12 19:16:34,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [391163495] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:34,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:34,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-12 19:16:34,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914013071] [2022-07-12 19:16:34,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:34,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:16:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:34,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:16:34,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:16:34,752 INFO L87 Difference]: Start difference. First operand 113 states and 122 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-12 19:16:35,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:35,162 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-07-12 19:16:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:35,163 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-12 19:16:35,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:35,164 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:16:35,164 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:16:35,164 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-12 19:16:35,165 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 6 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:35,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 416 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 230 Invalid, 0 Unknown, 63 Unchecked, 0.4s Time] [2022-07-12 19:16:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:16:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-07-12 19:16:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 113 states have internal predecessors, (121), 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-12 19:16:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2022-07-12 19:16:35,172 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 25 [2022-07-12 19:16:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:35,172 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2022-07-12 19:16:35,173 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-12 19:16:35,173 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-07-12 19:16:35,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:35,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:35,174 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-12 19:16:35,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-12 19:16:35,383 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-12 19:16:35,383 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:35,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:35,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578182, now seen corresponding path program 1 times [2022-07-12 19:16:35,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:35,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084367020] [2022-07-12 19:16:35,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:35,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:35,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:35,386 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-12 19:16:35,386 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-12 19:16:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:35,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:16:35,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:35,517 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-12 19:16:35,524 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-12 19:16:35,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:35,761 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-12 19:16:35,775 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:35,776 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-12 19:16:35,815 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-12 19:16:35,815 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:36,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:36,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084367020] [2022-07-12 19:16:36,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084367020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:36,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [123217392] [2022-07-12 19:16:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:36,320 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:16:36,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:16:36,323 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-12 19:16:36,324 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-12 19:16:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:36,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:16:36,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:36,516 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-12 19:16:36,524 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-12 19:16:38,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:38,687 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-12 19:16:38,697 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:38,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:16:38,720 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-12 19:16:38,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:40,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [123217392] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:40,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:40,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-12 19:16:40,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261394306] [2022-07-12 19:16:40,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:40,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:16:40,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:40,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:16:40,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:40,963 INFO L87 Difference]: Start difference. First operand 119 states and 127 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-12 19:16:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:41,548 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-07-12 19:16:41,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:16:41,549 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-12 19:16:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:41,550 INFO L225 Difference]: With dead ends: 129 [2022-07-12 19:16:41,550 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 19:16:41,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:16:41,551 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 7 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:41,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 424 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 322 Invalid, 0 Unknown, 73 Unchecked, 0.5s Time] [2022-07-12 19:16:41,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 19:16:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-07-12 19:16:41,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 118 states have internal predecessors, (127), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:16:41,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-07-12 19:16:41,558 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 25 [2022-07-12 19:16:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:41,558 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-07-12 19:16:41,558 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-12 19:16:41,558 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-07-12 19:16:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:41,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:41,560 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:41,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:41,772 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-12 19:16:41,963 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-12 19:16:41,964 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:41,964 INFO L85 PathProgramCache]: Analyzing trace with hash 131514271, now seen corresponding path program 1 times [2022-07-12 19:16:41,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:41,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115066003] [2022-07-12 19:16:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:41,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:41,966 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-12 19:16:41,968 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-12 19:16:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:42,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:16:42,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:42,191 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-12 19:16:42,211 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-12 19:16:42,315 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:16:42,315 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-12 19:16:42,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 5 treesize of output 3 [2022-07-12 19:16:42,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:42,415 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-12 19:16:42,595 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:16:42,596 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 17 [2022-07-12 19:16:42,625 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:42,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:42,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:42,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115066003] [2022-07-12 19:16:42,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115066003] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:42,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [560163067] [2022-07-12 19:16:42,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:42,871 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:16:42,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:16:42,876 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:16:42,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-12 19:16:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:43,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 19:16:43,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:43,192 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:16:43,193 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 17 [2022-07-12 19:16:43,255 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:16:43,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:16:43,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:43,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:43,342 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:16:43,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 31 [2022-07-12 19:16:43,434 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:16:43,434 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 22 treesize of output 18 [2022-07-12 19:16:43,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:43,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:43,567 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:16:43,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-12 19:16:43,763 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:16:43,764 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 22 treesize of output 18 [2022-07-12 19:16:43,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:43,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:43,875 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:16:43,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-12 19:16:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:16:43,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:43,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [560163067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:43,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:16:43,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 19:16:43,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403384122] [2022-07-12 19:16:43,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:43,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:16:43,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:43,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:16:43,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:16:43,985 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:44,426 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-12 19:16:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:16:44,427 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:16:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:44,428 INFO L225 Difference]: With dead ends: 127 [2022-07-12 19:16:44,428 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:16:44,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:16:44,429 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 3 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:44,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 451 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2022-07-12 19:16:44,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:16:44,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-12 19:16:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 74 states have (on average 1.7027027027027026) internal successors, (126), 117 states have internal predecessors, (126), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:16:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2022-07-12 19:16:44,436 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 37 [2022-07-12 19:16:44,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:44,437 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2022-07-12 19:16:44,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-07-12 19:16:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:44,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:44,438 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:44,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2022-07-12 19:16:44,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-12 19:16:44,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:44,843 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 131514272, now seen corresponding path program 1 times [2022-07-12 19:16:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:44,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781599960] [2022-07-12 19:16:44,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:44,845 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-12 19:16:44,847 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-12 19:16:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:45,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 19:16:45,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:45,098 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-12 19:16:45,104 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-12 19:16:45,124 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-12 19:16:45,128 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-12 19:16:47,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:47,244 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-12 19:16:47,256 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:47,256 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-12 19:16:47,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 5 treesize of output 3 [2022-07-12 19:16:49,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:49,447 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-12 19:16:49,759 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:16:49,759 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-12 19:16:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:49,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:50,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:50,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781599960] [2022-07-12 19:16:50,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781599960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [531271711] [2022-07-12 19:16:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:50,226 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:16:50,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:16:50,228 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:16:50,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-12 19:16:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:50,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:16:50,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:50,583 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-12 19:16:50,594 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-12 19:16:50,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:50,707 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-12 19:16:50,814 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-12 19:16:53,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:53,003 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-12 19:16:53,232 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-12 19:16:53,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:53,393 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-12 19:16:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:16:53,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:53,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [531271711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:53,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:16:53,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-07-12 19:16:53,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722827572] [2022-07-12 19:16:53,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:53,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:16:53,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:53,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:16:53,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2022-07-12 19:16:53,435 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:54,136 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-07-12 19:16:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:16:54,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:54,138 INFO L225 Difference]: With dead ends: 124 [2022-07-12 19:16:54,138 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 19:16:54,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2022-07-12 19:16:54,139 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 10 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:54,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 527 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 248 Invalid, 0 Unknown, 101 Unchecked, 0.6s Time] [2022-07-12 19:16:54,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 19:16:54,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-12 19:16:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 74 states have (on average 1.6891891891891893) internal successors, (125), 116 states have internal predecessors, (125), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:16:54,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-07-12 19:16:54,143 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 37 [2022-07-12 19:16:54,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:54,144 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-07-12 19:16:54,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-07-12 19:16:54,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:54,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:54,145 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-12 19:16:54,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:54,363 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-12 19:16:54,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:16:54,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:54,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1851258292, now seen corresponding path program 2 times [2022-07-12 19:16:54,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:54,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076397945] [2022-07-12 19:16:54,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:16:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:54,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:54,551 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-12 19:16:54,553 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-12 19:16:54,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:16:54,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:16:54,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:16:54,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:54,751 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-12 19:16:54,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:54,829 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-12 19:16:54,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076397945] [2022-07-12 19:16:54,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076397945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:54,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:54,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 19:16:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389983204] [2022-07-12 19:16:54,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:54,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:16:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:54,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:16:54,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:54,831 INFO L87 Difference]: Start difference. First operand 123 states and 133 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-12 19:16:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:54,865 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-07-12 19:16:54,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:54,866 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-12 19:16:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:54,866 INFO L225 Difference]: With dead ends: 116 [2022-07-12 19:16:54,866 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 19:16:54,867 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-12 19:16:54,867 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 196 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:54,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 244 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:54,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 19:16:54,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-12 19:16:54,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.6956521739130435) internal successors, (117), 110 states have internal predecessors, (117), 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-12 19:16:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-07-12 19:16:54,871 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 37 [2022-07-12 19:16:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:54,872 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-07-12 19:16:54,872 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-12 19:16:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-07-12 19:16:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:16:54,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:54,873 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:54,885 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-12 19:16:55,073 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-12 19:16:55,074 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:16:55,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 931477670, now seen corresponding path program 1 times [2022-07-12 19:16:55,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:16:55,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886152010] [2022-07-12 19:16:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:55,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:16:55,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:16:55,084 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-12 19:16:55,087 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-12 19:16:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:55,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:16:55,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:55,464 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-12 19:16:55,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 12 treesize of output 8 [2022-07-12 19:16:56,259 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:56,259 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 24 treesize of output 35 [2022-07-12 19:16:56,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:56,277 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 28 treesize of output 28 [2022-07-12 19:16:56,353 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 29 treesize of output 17 [2022-07-12 19:16:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:56,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:56,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:16:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886152010] [2022-07-12 19:16:56,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886152010] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:56,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [475252656] [2022-07-12 19:16:56,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:56,630 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:16:56,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:16:56,636 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:16:56,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-07-12 19:16:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:56,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:16:56,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:57,029 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-12 19:16:57,579 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 12 treesize of output 8 [2022-07-12 19:16:57,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:57,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 19:16:58,019 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:16:58,019 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 24 treesize of output 35 [2022-07-12 19:16:58,154 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 29 treesize of output 17 [2022-07-12 19:16:58,186 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:58,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:58,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [475252656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:58,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:58,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-07-12 19:16:58,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475830079] [2022-07-12 19:16:58,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:58,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:16:58,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:16:58,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:16:58,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=862, Unknown=3, NotChecked=0, Total=992 [2022-07-12 19:16:58,456 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 30 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:00,678 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2022-07-12 19:17:00,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:17:00,678 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-07-12 19:17:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:00,680 INFO L225 Difference]: With dead ends: 213 [2022-07-12 19:17:00,680 INFO L226 Difference]: Without dead ends: 213 [2022-07-12 19:17:00,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=242, Invalid=1556, Unknown=8, NotChecked=0, Total=1806 [2022-07-12 19:17:00,681 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 146 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:00,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 803 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 727 Invalid, 0 Unknown, 167 Unchecked, 1.6s Time] [2022-07-12 19:17:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-07-12 19:17:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 118. [2022-07-12 19:17:00,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.704225352112676) internal successors, (121), 112 states have internal predecessors, (121), 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-12 19:17:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2022-07-12 19:17:00,685 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 40 [2022-07-12 19:17:00,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:00,685 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2022-07-12 19:17:00,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:00,685 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2022-07-12 19:17:00,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 19:17:00,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:00,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:00,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:00,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-12 19:17:01,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:01,087 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash 931477671, now seen corresponding path program 1 times [2022-07-12 19:17:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:01,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033600628] [2022-07-12 19:17:01,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:01,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:01,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:01,089 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:01,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 19:17:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:01,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-12 19:17:01,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:01,423 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-12 19:17:01,430 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-12 19:17:01,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:01,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 19:17:01,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:02,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:02,268 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 28 treesize of output 28 [2022-07-12 19:17:02,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:02,281 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 16 treesize of output 18 [2022-07-12 19:17:02,313 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:02,313 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 18 treesize of output 18 [2022-07-12 19:17:02,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:02,331 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 14 treesize of output 16 [2022-07-12 19:17:02,442 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-12 19:17:02,449 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-12 19:17:02,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:02,552 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:03,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:03,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033600628] [2022-07-12 19:17:03,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033600628] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:03,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [731256064] [2022-07-12 19:17:03,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:03,159 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:03,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:03,164 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:03,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-12 19:17:03,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:03,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:17:03,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:03,718 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-12 19:17:03,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:04,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 19:17:04,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:04,844 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 28 treesize of output 28 [2022-07-12 19:17:04,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:04,863 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-12 19:17:04,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:04,875 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 16 treesize of output 18 [2022-07-12 19:17:04,891 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:04,891 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 18 treesize of output 18 [2022-07-12 19:17:05,028 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-12 19:17:05,034 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-12 19:17:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:05,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:05,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [731256064] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:05,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:05,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2022-07-12 19:17:05,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254304906] [2022-07-12 19:17:05,550 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:05,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 19:17:05,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:05,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 19:17:05,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1048, Unknown=5, NotChecked=0, Total=1190 [2022-07-12 19:17:05,551 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 30 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:07,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:07,358 INFO L93 Difference]: Finished difference Result 231 states and 244 transitions. [2022-07-12 19:17:07,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 19:17:07,359 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 40 [2022-07-12 19:17:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:07,359 INFO L225 Difference]: With dead ends: 231 [2022-07-12 19:17:07,360 INFO L226 Difference]: Without dead ends: 231 [2022-07-12 19:17:07,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=254, Invalid=1806, Unknown=10, NotChecked=0, Total=2070 [2022-07-12 19:17:07,361 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 156 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:07,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 507 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 376 Invalid, 0 Unknown, 124 Unchecked, 0.8s Time] [2022-07-12 19:17:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-12 19:17:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 118. [2022-07-12 19:17:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.6901408450704225) internal successors, (120), 112 states have internal predecessors, (120), 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-12 19:17:07,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2022-07-12 19:17:07,366 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 40 [2022-07-12 19:17:07,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:07,366 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2022-07-12 19:17:07,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.2222222222222223) internal successors, (60), 26 states have internal predecessors, (60), 4 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:07,367 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2022-07-12 19:17:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:17:07,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:07,367 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:07,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:07,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:07,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:07,780 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:07,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:07,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1188964921, now seen corresponding path program 1 times [2022-07-12 19:17:07,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:07,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309237753] [2022-07-12 19:17:07,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:07,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:07,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:07,782 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:07,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 19:17:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:07,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:17:07,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:08,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:08,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:08,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309237753] [2022-07-12 19:17:08,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309237753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:08,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:08,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:17:08,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361701345] [2022-07-12 19:17:08,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:08,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:17:08,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:08,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:17:08,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:17:08,013 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:08,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:08,054 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-07-12 19:17:08,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:17:08,055 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-12 19:17:08,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:08,055 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:17:08,056 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:17:08,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-12 19:17:08,056 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 99 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:08,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 229 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:17:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:17:08,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2022-07-12 19:17:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 71 states have (on average 1.676056338028169) internal successors, (119), 112 states have internal predecessors, (119), 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-12 19:17:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2022-07-12 19:17:08,060 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 41 [2022-07-12 19:17:08,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:08,061 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2022-07-12 19:17:08,061 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), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2022-07-12 19:17:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-12 19:17:08,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:08,062 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-12 19:17:08,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:08,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:08,271 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:08,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:08,272 INFO L85 PathProgramCache]: Analyzing trace with hash -132415732, now seen corresponding path program 1 times [2022-07-12 19:17:08,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:08,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222877998] [2022-07-12 19:17:08,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:08,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:08,274 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-12 19:17:08,275 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-12 19:17:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:08,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:17:08,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:08,479 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:08,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:09,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:09,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:09,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222877998] [2022-07-12 19:17:09,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222877998] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:09,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:09,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 19:17:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123559674] [2022-07-12 19:17:09,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:09,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:17:09,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:17:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:17:09,083 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:09,139 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2022-07-12 19:17:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:17:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-07-12 19:17:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:09,141 INFO L225 Difference]: With dead ends: 115 [2022-07-12 19:17:09,141 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 19:17:09,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:17:09,142 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 350 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:09,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 258 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:17:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 19:17:09,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-07-12 19:17:09,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.6428571428571428) internal successors, (115), 109 states have internal predecessors, (115), 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-12 19:17:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2022-07-12 19:17:09,145 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 43 [2022-07-12 19:17:09,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:09,146 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2022-07-12 19:17:09,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:09,146 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2022-07-12 19:17:09,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:17:09,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:09,147 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:09,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-12 19:17:09,355 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-12 19:17:09,356 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash 190077985, now seen corresponding path program 1 times [2022-07-12 19:17:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:09,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224976560] [2022-07-12 19:17:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:09,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:09,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:09,358 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-12 19:17:09,358 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-12 19:17:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:09,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:17:09,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:09,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:09,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:09,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224976560] [2022-07-12 19:17:09,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224976560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:09,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:09,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:17:09,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412421194] [2022-07-12 19:17:09,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:09,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:17:09,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:17:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:17:09,527 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:09,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:09,783 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-07-12 19:17:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:17:09,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-12 19:17:09,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:09,786 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:17:09,786 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:17:09,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-12 19:17:09,787 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 80 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:09,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 171 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:09,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:17:09,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 114. [2022-07-12 19:17:09,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 70 states have (on average 1.6285714285714286) internal successors, (114), 108 states have internal predecessors, (114), 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-12 19:17:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2022-07-12 19:17:09,791 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 44 [2022-07-12 19:17:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:09,792 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2022-07-12 19:17:09,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-07-12 19:17:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:17:09,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:09,793 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:09,802 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-12 19:17:09,999 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-12 19:17:09,999 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 190077986, now seen corresponding path program 1 times [2022-07-12 19:17:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:10,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1654984441] [2022-07-12 19:17:10,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:10,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:10,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:10,001 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-12 19:17:10,003 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-12 19:17:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:10,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:17:10,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:10,230 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:10,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:10,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:10,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1654984441] [2022-07-12 19:17:10,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1654984441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:10,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:10,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:17:10,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995602243] [2022-07-12 19:17:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:10,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:17:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:17:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:17:10,231 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:10,538 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2022-07-12 19:17:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:17:10,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-12 19:17:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:10,539 INFO L225 Difference]: With dead ends: 113 [2022-07-12 19:17:10,539 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 19:17:10,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 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-12 19:17:10,540 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 83 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:10,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 169 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:17:10,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 19:17:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-12 19:17:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.6142857142857143) internal successors, (113), 107 states have internal predecessors, (113), 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-12 19:17:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2022-07-12 19:17:10,544 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 44 [2022-07-12 19:17:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:10,544 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2022-07-12 19:17:10,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2022-07-12 19:17:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:17:10,545 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:10,545 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:10,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:10,755 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-12 19:17:10,756 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:10,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:10,756 INFO L85 PathProgramCache]: Analyzing trace with hash 190078242, now seen corresponding path program 1 times [2022-07-12 19:17:10,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:10,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666375483] [2022-07-12 19:17:10,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:10,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:10,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:10,758 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-12 19:17:10,761 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-12 19:17:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:10,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:17:10,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:17:11,017 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:11,017 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666375483] [2022-07-12 19:17:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666375483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:11,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:11,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:17:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838428173] [2022-07-12 19:17:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:11,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:17:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:17:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:17:11,019 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:11,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:11,215 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-07-12 19:17:11,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:11,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2022-07-12 19:17:11,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:11,216 INFO L225 Difference]: With dead ends: 109 [2022-07-12 19:17:11,216 INFO L226 Difference]: Without dead ends: 109 [2022-07-12 19:17:11,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:11,217 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 170 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:11,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 122 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-12 19:17:11,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-07-12 19:17:11,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 103 states have internal predecessors, (109), 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-12 19:17:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2022-07-12 19:17:11,220 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 44 [2022-07-12 19:17:11,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:11,220 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2022-07-12 19:17:11,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-07-12 19:17:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 19:17:11,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:11,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:11,235 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-12 19:17:11,431 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-12 19:17:11,432 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 190078241, now seen corresponding path program 1 times [2022-07-12 19:17:11,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:11,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474742195] [2022-07-12 19:17:11,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:11,433 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:11,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:11,434 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-12 19:17:11,435 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-12 19:17:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:11,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:17:11,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:17:11,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:11,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:11,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474742195] [2022-07-12 19:17:11,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474742195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:11,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:11,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:11,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959388801] [2022-07-12 19:17:11,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:11,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:11,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:11,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:11,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:11,600 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:11,751 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2022-07-12 19:17:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-07-12 19:17:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:11,752 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:17:11,752 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:17:11,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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-12 19:17:11,752 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 70 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:11,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 100 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:11,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:17:11,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 105. [2022-07-12 19:17:11,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.5) internal successors, (105), 99 states have internal predecessors, (105), 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-12 19:17:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-07-12 19:17:11,756 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 44 [2022-07-12 19:17:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:11,756 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-07-12 19:17:11,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:11,756 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-07-12 19:17:11,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:17:11,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:11,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:11,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:11,959 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-12 19:17:11,959 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1597450266, now seen corresponding path program 1 times [2022-07-12 19:17:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:11,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086102066] [2022-07-12 19:17:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:11,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:11,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:11,961 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-12 19:17:11,962 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-12 19:17:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:12,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:17:12,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:12,133 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-12 19:17:12,193 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:17:12,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:12,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:12,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086102066] [2022-07-12 19:17:12,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086102066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:12,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:12,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:12,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769001407] [2022-07-12 19:17:12,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:12,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:12,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:12,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:12,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:12,195 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:12,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:12,565 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-07-12 19:17:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:12,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-12 19:17:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:12,566 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:17:12,566 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:17:12,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 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-12 19:17:12,567 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 68 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:12,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 244 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:17:12,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:17:12,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2022-07-12 19:17:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.457142857142857) internal successors, (102), 96 states have internal predecessors, (102), 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-12 19:17:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2022-07-12 19:17:12,570 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 45 [2022-07-12 19:17:12,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:12,570 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2022-07-12 19:17:12,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2022-07-12 19:17:12,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 19:17:12,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:12,571 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:12,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:12,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:12,772 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1597450267, now seen corresponding path program 1 times [2022-07-12 19:17:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:12,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130197003] [2022-07-12 19:17:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:12,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:12,774 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:12,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 19:17:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:12,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:17:12,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:12,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-12 19:17:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:17:13,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:13,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:13,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130197003] [2022-07-12 19:17:13,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130197003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:13,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:13,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:13,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896139732] [2022-07-12 19:17:13,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:13,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:13,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:13,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:13,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:13,080 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:13,456 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-12 19:17:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2022-07-12 19:17:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:13,458 INFO L225 Difference]: With dead ends: 99 [2022-07-12 19:17:13,458 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 19:17:13,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:13,459 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 69 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:13,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 255 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:17:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 19:17:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-12 19:17:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 93 states have internal predecessors, (99), 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-12 19:17:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2022-07-12 19:17:13,462 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 45 [2022-07-12 19:17:13,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:13,463 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2022-07-12 19:17:13,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-07-12 19:17:13,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 19:17:13,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:13,464 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:13,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:13,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:13,674 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:13,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:13,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1846382939, now seen corresponding path program 1 times [2022-07-12 19:17:13,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:13,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963683613] [2022-07-12 19:17:13,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:13,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:13,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:13,676 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-12 19:17:13,677 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-12 19:17:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:13,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:17:13,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:13,884 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:17:13,884 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:13,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:13,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963683613] [2022-07-12 19:17:13,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963683613] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:13,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:13,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:17:13,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787449661] [2022-07-12 19:17:13,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:13,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:17:13,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:13,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:17:13,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:17:13,886 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:14,046 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-07-12 19:17:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:17:14,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-07-12 19:17:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:14,047 INFO L225 Difference]: With dead ends: 114 [2022-07-12 19:17:14,047 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 19:17:14,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 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-12 19:17:14,048 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 144 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:14,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 110 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 19:17:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-07-12 19:17:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 90 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-12 19:17:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2022-07-12 19:17:14,052 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 47 [2022-07-12 19:17:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:14,052 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2022-07-12 19:17:14,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2022-07-12 19:17:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 19:17:14,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:14,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:14,069 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-12 19:17:14,264 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-12 19:17:14,264 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:14,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1846382940, now seen corresponding path program 1 times [2022-07-12 19:17:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:14,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048759940] [2022-07-12 19:17:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:14,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:14,267 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-12 19:17:14,272 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-12 19:17:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:17:14,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:17:14,567 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:14,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:14,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048759940] [2022-07-12 19:17:14,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048759940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:14,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:14,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:17:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217611121] [2022-07-12 19:17:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:14,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:17:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:14,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:17:14,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:17:14,568 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:14,718 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-07-12 19:17:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:14,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2022-07-12 19:17:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:14,720 INFO L225 Difference]: With dead ends: 93 [2022-07-12 19:17:14,720 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 19:17:14,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:14,721 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 193 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:14,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 94 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 19:17:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-12 19:17:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 87 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-12 19:17:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-07-12 19:17:14,724 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 47 [2022-07-12 19:17:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:14,725 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-07-12 19:17:14,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-07-12 19:17:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:17:14,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:14,726 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:14,736 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-12 19:17:14,935 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-12 19:17:14,936 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:14,938 INFO L85 PathProgramCache]: Analyzing trace with hash 552513247, now seen corresponding path program 1 times [2022-07-12 19:17:14,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:14,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009281845] [2022-07-12 19:17:14,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:14,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:14,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:14,940 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-12 19:17:14,942 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-12 19:17:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:15,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 19:17:15,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:15,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:15,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:15,732 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1469 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1469) |c_#memory_$Pointer$.base|)) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2022-07-12 19:17:15,749 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1469))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-12 19:17:15,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:15,770 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-12 19:17:16,300 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:16,300 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 27 treesize of output 28 [2022-07-12 19:17:16,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:16,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-12 19:17:16,514 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 24 treesize of output 12 [2022-07-12 19:17:16,638 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-07-12 19:17:16,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:17,026 INFO L356 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2022-07-12 19:17:17,027 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 22 treesize of output 21 [2022-07-12 19:17:17,036 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1470) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-07-12 19:17:17,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1471 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1470) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) is different from false [2022-07-12 19:17:17,054 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1470) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|)) is different from false [2022-07-12 19:17:17,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1470) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0))) is different from false [2022-07-12 19:17:17,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1471 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1470) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse0))) is different from false [2022-07-12 19:17:17,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:17,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009281845] [2022-07-12 19:17:17,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009281845] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:17,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1758605372] [2022-07-12 19:17:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:17,284 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:17,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:17,285 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-12 19:17:17,286 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-12 19:17:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:17,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 19:17:17,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:18,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:18,575 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-12 19:17:19,124 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:19,125 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 14 treesize of output 20 [2022-07-12 19:17:19,137 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-12 19:17:19,472 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-12 19:17:20,214 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:17:20,215 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 27 [2022-07-12 19:17:20,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:20,469 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 19:17:20,469 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 2 case distinctions, treesize of input 42 treesize of output 50 [2022-07-12 19:17:20,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:21,018 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:21,019 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 52 [2022-07-12 19:17:24,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:24,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:24,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:17:24,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1549) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:17:24,942 INFO L356 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2022-07-12 19:17:24,942 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2022-07-12 19:17:25,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:25,016 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 60 treesize of output 85 [2022-07-12 19:17:25,023 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-12 19:17:26,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:26,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-12 19:17:28,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 19:17:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 1 not checked. [2022-07-12 19:17:28,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1758605372] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:28,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:17:28,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 15] total 61 [2022-07-12 19:17:28,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302356427] [2022-07-12 19:17:28,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:28,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-12 19:17:28,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-12 19:17:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=3411, Unknown=42, NotChecked=1134, Total=4830 [2022-07-12 19:17:28,555 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 62 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 55 states have internal predecessors, (115), 6 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 19:17:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:32,727 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2022-07-12 19:17:32,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 19:17:32,727 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 55 states have internal predecessors, (115), 6 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) Word has length 49 [2022-07-12 19:17:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:32,728 INFO L225 Difference]: With dead ends: 104 [2022-07-12 19:17:32,728 INFO L226 Difference]: Without dead ends: 104 [2022-07-12 19:17:32,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 86 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2028 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=418, Invalid=6044, Unknown=54, NotChecked=1494, Total=8010 [2022-07-12 19:17:32,731 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 41 mSDsluCounter, 1381 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 825 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:32,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1448 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 348 Invalid, 0 Unknown, 825 Unchecked, 0.7s Time] [2022-07-12 19:17:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-12 19:17:32,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-12 19:17:32,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.3) internal successors, (104), 97 states have internal predecessors, (104), 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-12 19:17:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2022-07-12 19:17:32,734 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 49 [2022-07-12 19:17:32,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:32,734 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2022-07-12 19:17:32,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.9827586206896552) internal successors, (115), 55 states have internal predecessors, (115), 6 states have call successors, (9), 4 states have call predecessors, (9), 7 states have return successors, (9), 8 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 19:17:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2022-07-12 19:17:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:17:32,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:32,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:32,743 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-12 19:17:32,952 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-12 19:17:33,143 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-12 19:17:33,143 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash 552513248, now seen corresponding path program 1 times [2022-07-12 19:17:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:33,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739508661] [2022-07-12 19:17:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:33,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:33,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:33,145 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-12 19:17:33,146 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-12 19:17:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:33,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-12 19:17:33,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:33,626 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-12 19:17:33,864 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-12 19:17:34,031 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:34,032 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 20 treesize of output 27 [2022-07-12 19:17:34,216 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-12 19:17:34,434 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:34,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-07-12 19:17:34,707 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:34,708 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 31 [2022-07-12 19:17:34,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-07-12 19:17:34,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 19:17:34,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:35,197 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:17:35,198 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 66 treesize of output 66 [2022-07-12 19:17:35,228 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:35,228 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 49 treesize of output 51 [2022-07-12 19:17:35,255 INFO L356 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-07-12 19:17:35,255 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 30 treesize of output 32 [2022-07-12 19:17:35,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:17:35,281 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 40 treesize of output 30 [2022-07-12 19:17:35,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2022-07-12 19:17:36,255 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:17:36,255 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 2 case distinctions, treesize of input 74 treesize of output 63 [2022-07-12 19:17:36,263 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 42 treesize of output 40 [2022-07-12 19:17:36,271 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 25 treesize of output 13 [2022-07-12 19:17:36,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:36,458 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 14 treesize of output 16 [2022-07-12 19:17:36,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:36,472 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 30 [2022-07-12 19:17:36,731 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 17 [2022-07-12 19:17:36,740 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-12 19:17:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:36,953 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:37,394 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_insert_~new_node~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:37,433 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1634) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:37,524 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_sll_circular_insert_~last~1#1.base| v_ArrVal_1634) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:37,555 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1634) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:37,606 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1636) |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| .cse1 v_ArrVal_1634) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-12 19:17:37,652 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1637 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1636) |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| .cse0 v_ArrVal_1634) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1637) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_1636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1635) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1636) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32)))))) is different from false [2022-07-12 19:17:38,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:38,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739508661] [2022-07-12 19:17:38,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739508661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:38,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2076457117] [2022-07-12 19:17:38,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:38,845 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:38,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:38,847 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-12 19:17:38,847 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-12 19:17:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:39,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-12 19:17:39,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:39,646 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-12 19:17:41,097 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 5 [2022-07-12 19:17:41,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:42,398 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:42,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:17:42,411 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-12 19:17:42,511 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:42,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-07-12 19:17:42,550 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-12 19:17:42,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:17:42,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-12 19:17:44,450 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:17:44,451 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 56 treesize of output 46 [2022-07-12 19:17:44,487 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:17:44,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 28 [2022-07-12 19:17:44,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:44,889 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 19:17:44,890 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 2 case distinctions, treesize of input 53 treesize of output 59 [2022-07-12 19:17:44,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:44,956 INFO L356 Elim1Store]: treesize reduction 31, result has 35.4 percent of original size [2022-07-12 19:17:44,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 67 [2022-07-12 19:17:45,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:45,745 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:45,746 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 48 [2022-07-12 19:17:45,754 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:45,754 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 62 treesize of output 50 [2022-07-12 19:17:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:48,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:48,366 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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_insert_~new_node~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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))))) is different from false [2022-07-12 19:17:48,420 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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_1728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:48,602 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:48,680 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1727 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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))))) is different from false [2022-07-12 19:17:48,779 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1727 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |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| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1727) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-12 19:17:48,865 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1727 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1728) |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| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1727) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (forall ((v_ArrVal_1728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1728) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))) is different from false [2022-07-12 19:17:50,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2076457117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:50,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:50,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 23] total 53 [2022-07-12 19:17:50,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500824262] [2022-07-12 19:17:50,484 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:50,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-12 19:17:50,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-12 19:17:50,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=3159, Unknown=16, NotChecked=1500, Total=4970 [2022-07-12 19:17:50,487 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand has 54 states, 50 states have (on average 1.72) internal successors, (86), 45 states have internal predecessors, (86), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:17:55,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:55,371 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2022-07-12 19:17:55,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 19:17:55,372 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 50 states have (on average 1.72) internal successors, (86), 45 states have internal predecessors, (86), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2022-07-12 19:17:55,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:55,373 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:17:55,373 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:17:55,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1905 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=431, Invalid=4854, Unknown=19, NotChecked=1836, Total=7140 [2022-07-12 19:17:55,375 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 46 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:55,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1108 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 361 Invalid, 0 Unknown, 401 Unchecked, 1.3s Time] [2022-07-12 19:17:55,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:17:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2022-07-12 19:17:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.2875) internal successors, (103), 97 states have internal predecessors, (103), 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-12 19:17:55,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2022-07-12 19:17:55,378 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 49 [2022-07-12 19:17:55,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:55,378 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2022-07-12 19:17:55,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 50 states have (on average 1.72) internal successors, (86), 45 states have internal predecessors, (86), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:17:55,379 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-07-12 19:17:55,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 19:17:55,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:55,379 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:55,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:55,587 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-12 19:17:55,780 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-12 19:17:55,780 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash -220833143, now seen corresponding path program 1 times [2022-07-12 19:17:55,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:55,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920479695] [2022-07-12 19:17:55,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:55,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:55,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:55,783 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-12 19:17:55,785 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-12 19:17:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:55,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:17:55,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:56,178 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-12 19:17:56,183 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-12 19:17:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:56,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:56,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:56,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920479695] [2022-07-12 19:17:56,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920479695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:56,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:56,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-12 19:17:56,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86748839] [2022-07-12 19:17:56,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:56,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:17:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:56,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:17:56,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:17:56,522 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:57,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:57,249 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-07-12 19:17:57,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:17:57,250 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-12 19:17:57,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:57,250 INFO L225 Difference]: With dead ends: 96 [2022-07-12 19:17:57,251 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 19:17:57,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:17:57,251 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 8 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:57,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 508 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 19:17:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 19:17:57,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-12 19:17:57,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 89 states have internal predecessors, (94), 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-12 19:17:57,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-07-12 19:17:57,254 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 50 [2022-07-12 19:17:57,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:57,254 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-07-12 19:17:57,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:57,254 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-07-12 19:17:57,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:17:57,255 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:57,255 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:57,271 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-12 19:17:57,455 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-12 19:17:57,455 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:17:57,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:57,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1610711870, now seen corresponding path program 1 times [2022-07-12 19:17:57,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:57,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1483617650] [2022-07-12 19:17:57,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:57,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:57,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:57,457 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-12 19:17:57,458 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-12 19:17:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:57,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 19:17:57,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:57,905 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-12 19:17:58,389 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-12 19:17:58,675 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:58,675 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 20 treesize of output 27 [2022-07-12 19:17:59,013 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-12 19:17:59,033 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 19 treesize of output 18 [2022-07-12 19:17:59,557 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:59,557 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 40 [2022-07-12 19:17:59,568 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-12 19:18:00,220 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:00,220 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 32 [2022-07-12 19:18:00,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 19:18:00,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:00,249 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 7 treesize of output 3 [2022-07-12 19:18:01,283 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:18:01,283 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 67 treesize of output 67 [2022-07-12 19:18:01,342 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:01,342 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 48 treesize of output 50 [2022-07-12 19:18:01,403 INFO L356 Elim1Store]: treesize reduction 8, result has 70.4 percent of original size [2022-07-12 19:18:01,403 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 29 treesize of output 31 [2022-07-12 19:18:01,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-12 19:18:01,455 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 26 [2022-07-12 19:18:01,536 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 81 treesize of output 65 [2022-07-12 19:18:03,288 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:18:03,288 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 2 case distinctions, treesize of input 99 treesize of output 84 [2022-07-12 19:18:03,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2022-07-12 19:18:03,305 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 42 treesize of output 40 [2022-07-12 19:18:03,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:18:03,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:03,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-07-12 19:18:03,525 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 18 treesize of output 20 [2022-07-12 19:18:03,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:03,552 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 14 treesize of output 16 [2022-07-12 19:18:03,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-07-12 19:18:03,960 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-12 19:18:04,331 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-12 19:18:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:04,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:04,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |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_insert_~new_node~0#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:18:04,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (_ BitVec 32)) (v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_1887)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1884) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) is different from false [2022-07-12 19:18:05,083 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (_ BitVec 32)) (v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_1887)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1884) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:18:05,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (_ BitVec 32)) (v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| v_ArrVal_1887)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1884) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-12 19:18:05,140 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (_ BitVec 32)) (v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1887)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1889) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1884) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-12 19:18:05,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1887 (_ BitVec 32)) (v_ArrVal_1890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1886 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1888 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1887)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1889) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1884) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1890) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1886) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1888) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-12 19:18:06,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:06,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1483617650] [2022-07-12 19:18:06,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1483617650] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:06,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1154719529] [2022-07-12 19:18:06,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:06,029 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:06,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:06,030 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:06,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2022-07-12 19:18:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:06,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 19:18:06,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:06,540 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-12 19:18:07,241 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-12 19:18:07,906 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:07,906 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 20 treesize of output 27 [2022-07-12 19:18:08,645 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 19 treesize of output 18 [2022-07-12 19:18:09,083 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-12 19:18:10,252 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 21 treesize of output 13 [2022-07-12 19:18:10,262 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-12 19:18:10,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:10,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:11,419 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-12 19:18:12,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:12,302 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 45 treesize of output 41 [2022-07-12 19:18:12,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:12,322 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 18 treesize of output 20 [2022-07-12 19:18:12,411 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 19:18:12,412 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 26 treesize of output 28 [2022-07-12 19:18:12,543 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:12,543 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:18:12,565 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-12 19:18:15,247 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:15,248 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 70 treesize of output 63 [2022-07-12 19:18:15,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-07-12 19:18:15,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:15,277 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 18 treesize of output 20 [2022-07-12 19:18:15,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:15,706 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 33 treesize of output 31 [2022-07-12 19:18:15,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-12 19:18:15,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:15,732 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 14 treesize of output 16 [2022-07-12 19:18:16,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 34 treesize of output 18 [2022-07-12 19:18:16,505 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-12 19:18:17,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 19:18:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:17,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:17,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1992 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1992)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1990) |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_insert_~new_node~0#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:18:17,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (_ BitVec 32)) (v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1992 (_ BitVec 32)) (v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_1986)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1992))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1987) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_1988) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:18:17,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (_ BitVec 32)) (v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1992 (_ BitVec 32)) (v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| v_ArrVal_1986)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1992))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1987) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_1988) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) is different from false [2022-07-12 19:18:17,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (_ BitVec 32)) (v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1992 (_ BitVec 32)) (v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| v_ArrVal_1986)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1992))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1987) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_1988) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 32))))) is different from false [2022-07-12 19:18:17,445 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (_ BitVec 32)) (v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1992 (_ BitVec 32)) (v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1986)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset| v_ArrVal_1992))) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1987) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1988) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-07-12 19:18:17,482 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1986 (_ BitVec 32)) (v_ArrVal_1990 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1993 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1988 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1992 (_ BitVec 32)) (v_ArrVal_1987 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_1986)))) (store .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset| v_ArrVal_1992))) (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1987) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1990) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1988) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_1993) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-07-12 19:18:17,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:17,952 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 134 [2022-07-12 19:18:19,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1154719529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:19,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:19,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 57 [2022-07-12 19:18:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893102850] [2022-07-12 19:18:19,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:19,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 19:18:19,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 19:18:19,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3660, Unknown=31, NotChecked=1596, Total=5550 [2022-07-12 19:18:19,500 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 57 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 48 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:18:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:24,899 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-07-12 19:18:24,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 19:18:24,899 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 48 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 51 [2022-07-12 19:18:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:24,900 INFO L225 Difference]: With dead ends: 97 [2022-07-12 19:18:24,900 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 19:18:24,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1767 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=382, Invalid=5792, Unknown=36, NotChecked=1980, Total=8190 [2022-07-12 19:18:24,903 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 573 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:24,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1105 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 223 Invalid, 0 Unknown, 573 Unchecked, 0.7s Time] [2022-07-12 19:18:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 19:18:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-12 19:18:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 90 states have internal predecessors, (95), 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-12 19:18:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-07-12 19:18:24,906 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 51 [2022-07-12 19:18:24,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:24,906 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-07-12 19:18:24,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 48 states have internal predecessors, (80), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:18:24,906 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-07-12 19:18:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:18:24,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:24,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:24,922 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-12 19:18:25,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:25,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:25,320 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:18:25,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:25,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1610711872, now seen corresponding path program 1 times [2022-07-12 19:18:25,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:25,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327313167] [2022-07-12 19:18:25,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:25,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:25,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:25,322 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-12 19:18:25,323 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-12 19:18:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:25,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:18:25,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 19:18:25,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:25,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:25,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327313167] [2022-07-12 19:18:25,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327313167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:25,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:25,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:18:25,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669054067] [2022-07-12 19:18:25,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:25,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:18:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:18:25,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:18:25,541 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:18:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:25,665 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2022-07-12 19:18:25,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:18:25,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-07-12 19:18:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:25,666 INFO L225 Difference]: With dead ends: 98 [2022-07-12 19:18:25,666 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 19:18:25,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 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-12 19:18:25,666 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:25,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 126 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:18:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 19:18:25,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-07-12 19:18:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 89 states have internal predecessors, (94), 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-12 19:18:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-07-12 19:18:25,669 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 51 [2022-07-12 19:18:25,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:25,670 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-07-12 19:18:25,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:18:25,670 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-07-12 19:18:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:18:25,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:25,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:25,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-12 19:18:25,879 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-12 19:18:25,879 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:18:25,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:25,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1610711871, now seen corresponding path program 1 times [2022-07-12 19:18:25,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:25,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239661035] [2022-07-12 19:18:25,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:25,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:25,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:25,881 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-12 19:18:25,882 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-12 19:18:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:26,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 19:18:26,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:26,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:26,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:26,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:26,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:27,448 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:27,449 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 14 treesize of output 20 [2022-07-12 19:18:27,466 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-12 19:18:27,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:27,485 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-12 19:18:27,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-12 19:18:28,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:28,328 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-12 19:18:28,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:28,622 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-12 19:18:28,793 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-12 19:18:29,088 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:29,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:29,253 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 22 treesize of output 18 [2022-07-12 19:18:29,734 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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))))) (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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-12 19:18:29,771 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32)))))) is different from false [2022-07-12 19:18:29,866 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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-12 19:18:29,902 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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-12 19:18:29,948 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2150) |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-12 19:18:29,996 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2150) |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_2150 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2149 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) v_ArrVal_2149) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2150) |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-12 19:18:33,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:33,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239661035] [2022-07-12 19:18:33,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239661035] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:33,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1813850582] [2022-07-12 19:18:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:33,000 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:33,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:33,001 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:33,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-07-12 19:18:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:33,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 19:18:33,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:35,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:36,205 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:36,205 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 14 treesize of output 20 [2022-07-12 19:18:36,217 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-12 19:18:36,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:37,733 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:18:37,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2022-07-12 19:18:37,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:37,972 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-12 19:18:38,205 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-12 19:18:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:38,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:38,274 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 22 treesize of output 18 [2022-07-12 19:18:38,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2231 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2231) |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-12 19:18:39,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2231 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2231) |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-12 19:18:39,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2231 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2231) |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-12 19:18:39,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2231 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2231) |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-12 19:18:39,093 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 59 treesize of output 43 [2022-07-12 19:18:39,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_218 (_ BitVec 32)) (v_ArrVal_2231 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| v_arrayElimCell_218 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_218) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2231) |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-12 19:18:39,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_218 (_ BitVec 32)) (v_ArrVal_2231 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| v_arrayElimCell_218 (store (select |c_#memory_$Pointer$.offset| v_arrayElimCell_218) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2231) |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-12 19:18:44,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1813850582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:44,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:44,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 43 [2022-07-12 19:18:44,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111066586] [2022-07-12 19:18:44,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:44,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 19:18:44,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:44,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 19:18:44,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=2492, Unknown=53, NotChecked=1356, Total=4160 [2022-07-12 19:18:44,888 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 44 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 38 states have internal predecessors, (79), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:18:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:55,595 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-07-12 19:18:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 19:18:55,596 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 38 states have internal predecessors, (79), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-12 19:18:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:55,596 INFO L225 Difference]: With dead ends: 98 [2022-07-12 19:18:55,596 INFO L226 Difference]: Without dead ends: 98 [2022-07-12 19:18:55,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 1270 ImplicationChecksByTransitivity, 23.4s TimeCoverageRelationStatistics Valid=389, Invalid=3891, Unknown=58, NotChecked=1668, Total=6006 [2022-07-12 19:18:55,598 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 36 mSDsluCounter, 1015 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:55,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1072 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 282 Invalid, 0 Unknown, 302 Unchecked, 2.8s Time] [2022-07-12 19:18:55,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-12 19:18:55,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-07-12 19:18:55,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.25) internal successors, (95), 90 states have internal predecessors, (95), 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-12 19:18:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 101 transitions. [2022-07-12 19:18:55,607 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 101 transitions. Word has length 51 [2022-07-12 19:18:55,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:55,608 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 101 transitions. [2022-07-12 19:18:55,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 38 states have internal predecessors, (79), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:18:55,608 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-07-12 19:18:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:18:55,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:55,609 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:55,624 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-12 19:18:55,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:56,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:56,018 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:18:56,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:56,018 INFO L85 PathProgramCache]: Analyzing trace with hash -761382723, now seen corresponding path program 1 times [2022-07-12 19:18:56,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:56,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092495798] [2022-07-12 19:18:56,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:56,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:56,024 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:56,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-12 19:18:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:56,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:18:56,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:56,370 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-12 19:18:57,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:57,677 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-12 19:18:57,977 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:18:57,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:57,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:57,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092495798] [2022-07-12 19:18:57,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092495798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:57,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:57,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:18:57,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755225834] [2022-07-12 19:18:57,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:57,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:18:57,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:57,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:18:57,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:18:57,978 INFO L87 Difference]: Start difference. First operand 97 states and 101 transitions. Second operand has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:02,149 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2022-07-12 19:19:02,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:19:02,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-12 19:19:02,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:02,151 INFO L225 Difference]: With dead ends: 158 [2022-07-12 19:19:02,151 INFO L226 Difference]: Without dead ends: 158 [2022-07-12 19:19:02,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:19:02,151 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 179 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:02,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 475 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 19:19:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-12 19:19:02,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 98. [2022-07-12 19:19:02,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 91 states have internal predecessors, (97), 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-12 19:19:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-07-12 19:19:02,155 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 51 [2022-07-12 19:19:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:02,155 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-07-12 19:19:02,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:02,155 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-07-12 19:19:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:19:02,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:02,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:19:02,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-12 19:19:02,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:19:02,367 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:19:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:02,367 INFO L85 PathProgramCache]: Analyzing trace with hash -761382722, now seen corresponding path program 1 times [2022-07-12 19:19:02,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:19:02,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196435022] [2022-07-12 19:19:02,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:02,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:19:02,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:19:02,368 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-12 19:19:02,369 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-12 19:19:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:02,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:19:02,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:02,762 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-12 19:19:04,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:19:04,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:19:04,715 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-12 19:19:04,733 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-12 19:19:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 19:19:05,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:19:05,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:19:05,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196435022] [2022-07-12 19:19:05,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196435022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:19:05,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:19:05,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:19:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354761572] [2022-07-12 19:19:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:19:05,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:19:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:19:05,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:19:05,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:19:05,139 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:09,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:09,087 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-07-12 19:19:09,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:19:09,088 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-07-12 19:19:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:09,089 INFO L225 Difference]: With dead ends: 140 [2022-07-12 19:19:09,089 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 19:19:09,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:19:09,090 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 113 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:09,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 555 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 19:19:09,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 19:19:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 99. [2022-07-12 19:19:09,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 92 states have internal predecessors, (98), 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-12 19:19:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-07-12 19:19:09,092 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 51 [2022-07-12 19:19:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:09,093 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-07-12 19:19:09,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.875) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:09,093 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-07-12 19:19:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:19:09,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:09,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:19:09,107 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-12 19:19:09,303 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-12 19:19:09,303 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:19:09,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:09,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1544354016, now seen corresponding path program 1 times [2022-07-12 19:19:09,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:19:09,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553234488] [2022-07-12 19:19:09,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:09,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:19:09,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:19:09,305 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-12 19:19:09,306 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-12 19:19:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:09,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:19:09,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:09,695 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-12 19:19:10,509 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-12 19:19:11,266 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-12 19:19:12,045 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-12 19:19:12,361 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:19:12,361 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-12 19:19:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:19:12,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:19:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:19:15,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:19:15,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553234488] [2022-07-12 19:19:15,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553234488] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:19:15,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:19:15,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2022-07-12 19:19:15,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256801595] [2022-07-12 19:19:15,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:19:15,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:19:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:19:15,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:19:15,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:19:15,597 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 19:19:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:17,049 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-07-12 19:19:17,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:19:17,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2022-07-12 19:19:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:17,050 INFO L225 Difference]: With dead ends: 90 [2022-07-12 19:19:17,050 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 19:19:17,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:19:17,051 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:17,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 133 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 59 Invalid, 0 Unknown, 33 Unchecked, 0.6s Time] [2022-07-12 19:19:17,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 19:19:17,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-12 19:19:17,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 83 states have internal predecessors, (87), 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-12 19:19:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-07-12 19:19:17,054 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 53 [2022-07-12 19:19:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:17,054 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-07-12 19:19:17,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 7 states have internal predecessors, (43), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-12 19:19:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-07-12 19:19:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 19:19:17,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:17,055 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:19:17,065 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-12 19:19:17,259 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-12 19:19:17,259 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-12 19:19:17,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:17,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1326985614, now seen corresponding path program 1 times [2022-07-12 19:19:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:19:17,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768273493] [2022-07-12 19:19:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:17,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:19:17,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:19:17,261 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-12 19:19:17,262 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-12 19:19:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:17,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-12 19:19:17,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:17,859 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-12 19:19:19,957 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:19:19,958 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 20 treesize of output 27 [2022-07-12 19:19:20,947 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-12 19:19:22,274 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:19:22,274 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 31 treesize of output 32 [2022-07-12 19:19:23,892 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:19:23,892 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-07-12 19:19:23,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 19:19:23,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:19:26,760 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-12 19:19:26,760 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 56 treesize of output 58 [2022-07-12 19:19:26,939 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:19:26,940 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 48 treesize of output 50 [2022-07-12 19:19:27,328 INFO L356 Elim1Store]: treesize reduction 60, result has 42.9 percent of original size [2022-07-12 19:19:27,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 62 [2022-07-12 19:19:27,386 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 59 treesize of output 47 [2022-07-12 19:19:27,617 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 128 treesize of output 114 [2022-07-12 19:19:34,111 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:19:34,112 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 2 case distinctions, treesize of input 113 treesize of output 59 [2022-07-12 19:19:34,250 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:19:34,250 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 1 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 19:19:35,155 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 19:19:35,155 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 103 [2022-07-12 19:19:35,287 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:19:35,288 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 97 treesize of output 92 [2022-07-12 19:19:36,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 62 [2022-07-12 19:19:38,309 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:19:38,310 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 42 [2022-07-12 19:19:40,770 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:19:40,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:19:43,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2543))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-12 19:19:44,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2543))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2539) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-12 19:19:44,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2543))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_2539) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-12 19:19:44,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2543))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2539) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv1 1))) is different from false [2022-07-12 19:19:44,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2543))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2539) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2542) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (_ bv1 1))) is different from false [2022-07-12 19:19:46,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:19:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768273493] [2022-07-12 19:19:46,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768273493] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:46,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [425729287] [2022-07-12 19:19:46,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:46,353 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:19:46,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:19:46,354 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:19:46,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2022-07-12 19:19:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:46,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 19:19:46,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:47,190 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-12 19:19:53,516 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 20 treesize of output 12 [2022-07-12 19:19:53,537 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 8 treesize of output 6 [2022-07-12 19:19:57,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:57,757 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 26 treesize of output 26 [2022-07-12 19:19:57,976 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:19:57,977 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 24 treesize of output 35 [2022-07-12 19:20:03,694 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 19:20:03,694 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 44 [2022-07-12 19:20:03,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:20:03,733 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 26 treesize of output 28 [2022-07-12 19:20:04,974 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 19:20:04,975 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 90 [2022-07-12 19:20:05,099 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:20:05,099 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 71 treesize of output 70 [2022-07-12 19:20:06,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 60 treesize of output 44 [2022-07-12 19:20:08,965 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:20:08,965 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 31 [2022-07-12 19:20:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:20:13,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:20:13,480 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2630) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-12 19:20:15,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2630 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_2628) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2630) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-12 19:20:16,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:20:16,970 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 284 treesize of output 259 [2022-07-12 19:20:16,993 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 124 treesize of output 122 [2022-07-12 19:20:17,016 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 246 treesize of output 242 [2022-07-12 19:20:21,442 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse28 (not .cse18)) (.cse6 (not .cse17))) (let ((.cse0 (let ((.cse45 (or .cse6 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse55 (store (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse56 (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1))))))) (and (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse31 (let ((.cse34 (store (let ((.cse35 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse35 (store (select |c_#memory_$Pointer$.base| .cse35) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_268))) (_ bv1 1))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse32 (store (let ((.cse33 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse33 (store (select |c_#memory_$Pointer$.base| .cse33) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1))))))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse36 (let ((.cse37 (store (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse38 (store (select |c_#memory_$Pointer$.base| .cse38) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_268))) (_ bv1 1)))))) .cse17) (or .cse18 (and (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse39 (store (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse40 (store (select |c_#memory_$Pointer$.base| .cse40) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse39 (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1))) .cse17) (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse41 (store (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse42 (store (select |c_#memory_$Pointer$.base| .cse42) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse43 (store (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse44 (store (select |c_#memory_$Pointer$.base| .cse44) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse43 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))))) .cse45)) (or (and (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse46 (store (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse47 (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse46 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1)))) .cse17) (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse48 (store (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse48 (select (select .cse48 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse50 (store (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse50 (select (select .cse50 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))))) .cse45) .cse28) (or .cse6 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (let ((.cse53 (store (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse53 (select (select .cse53 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse52 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse52 v_arrayElimCell_269))) (_ bv1 1))))))) .cse45))) (.cse10 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse29 (store (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse30 (store (select |c_#memory_$Pointer$.base| .cse30) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))) .cse6))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse1 (let ((.cse4 (store (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_268))))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse2 (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_266))) (_ bv1 1)))))) (or .cse6 (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse8 (store (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse7 v_arrayElimCell_266))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse7 v_arrayElimCell_269))) (_ bv1 1))))))) .cse10 (or (and .cse10 (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse11 (store (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse13 (store (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1))))) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse15 (store (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)))) .cse17)) .cse18) (or .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse19 (let ((.cse20 (store (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse21 (store (select |c_#memory_$Pointer$.base| .cse21) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse19 v_arrayElimCell_268))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse19 v_arrayElimCell_266))) (_ bv1 1)))))) .cse17) (or (and (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse22 (store (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268)))))) .cse17) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse24 (store (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse25 (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse26 (store (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse27 (store (select |c_#memory_$Pointer$.base| .cse27) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))))) .cse10) .cse28))))) is different from false [2022-07-12 19:20:23,465 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) (.cse18 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse28 (not .cse18)) (.cse6 (not .cse17))) (let ((.cse0 (let ((.cse45 (or .cse6 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse55 (store (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse56 (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1))))))) (and (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse31 (let ((.cse34 (store (let ((.cse35 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse35 (store (select |c_#memory_$Pointer$.base| .cse35) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_268))) (_ bv1 1))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse32 (store (let ((.cse33 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse33 (store (select |c_#memory_$Pointer$.base| .cse33) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1))))))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse36 (let ((.cse37 (store (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse38 (store (select |c_#memory_$Pointer$.base| .cse38) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_268))) (_ bv1 1)))))) .cse17) (or .cse18 (and (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse39 (store (let ((.cse40 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse40 (store (select |c_#memory_$Pointer$.base| .cse40) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse39 (select (select .cse39 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1))) .cse17) (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse41 (store (let ((.cse42 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse42 (store (select |c_#memory_$Pointer$.base| .cse42) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse41 (select (select .cse41 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse43 (store (let ((.cse44 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse44 (store (select |c_#memory_$Pointer$.base| .cse44) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse43 (select (select .cse43 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))))) .cse45)) (or (and (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse46 (store (let ((.cse47 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse47 (store (select |c_#memory_$Pointer$.base| .cse47) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse46 (select (select .cse46 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1)))) .cse17) (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse48 (store (let ((.cse49 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse49 (store (select |c_#memory_$Pointer$.base| .cse49) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse48 (select (select .cse48 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse50 (store (let ((.cse51 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse51 (store (select |c_#memory_$Pointer$.base| .cse51) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse50 (select (select .cse50 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))))) .cse45) .cse28) (or .cse6 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse52 (let ((.cse53 (store (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse53 (select (select .cse53 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse52 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse52 v_arrayElimCell_269))) (_ bv1 1))))))) .cse45))) (.cse10 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse29 (store (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse30 (store (select |c_#memory_$Pointer$.base| .cse30) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))) .cse6))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse1 (let ((.cse4 (store (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_268))))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse2 (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_266))) (_ bv1 1)))))) (or .cse6 (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse8 (store (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse8 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse7 v_arrayElimCell_266))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse7 v_arrayElimCell_269))) (_ bv1 1))))))) .cse10 (or (and .cse10 (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse11 (store (let ((.cse12 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse12 (store (select |c_#memory_$Pointer$.base| .cse12) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse11 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse13 (store (let ((.cse14 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse14 (store (select |c_#memory_$Pointer$.base| .cse14) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse13 (select (select .cse13 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1))))) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse15 (store (let ((.cse16 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse16 (store (select |c_#memory_$Pointer$.base| .cse16) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse15 (select (select .cse15 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)))) .cse17)) .cse18) (or .cse0 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|)) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse19 (let ((.cse20 (store (let ((.cse21 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse21 (store (select |c_#memory_$Pointer$.base| .cse21) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse20 (select (select .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse19 v_arrayElimCell_268))))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse19 v_arrayElimCell_266))) (_ bv1 1)))))) .cse17) (or (and (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse22 (store (let ((.cse23 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse23 (store (select |c_#memory_$Pointer$.base| .cse23) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse22 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268)))))) .cse17) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse24 (store (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse25 (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))))) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse26 (store (let ((.cse27 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse27 (store (select |c_#memory_$Pointer$.base| .cse27) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2629))) (select .cse26 (select (select .cse26 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)))))) .cse10) .cse28))))) is different from true [2022-07-12 19:20:26,399 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse23 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse16 (not .cse23)) (.cse4 (not .cse8))) (let ((.cse9 (let ((.cse39 (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse55 (store (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse56 (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) .cse4))) (and (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse31 (let ((.cse34 (store (let ((.cse35 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse35 (store (select |c_#memory_$Pointer$.base| .cse35) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_268)))) (_ bv0 1)) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse32 (store (let ((.cse33 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse33 (store (select |c_#memory_$Pointer$.base| .cse33) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_266))) (_ bv1 1)))))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse36 (let ((.cse37 (store (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse38 (store (select |c_#memory_$Pointer$.base| .cse38) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_268)))) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_266))) (_ bv1 1)))))) .cse8) .cse39 (or (and (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse40 (store (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse41 (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268)))) (_ bv0 1)) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse42 (store (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse43 (store (select |c_#memory_$Pointer$.base| .cse43) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse42 (select (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse44 (store (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268)))) (_ bv0 1))) .cse8) .cse39) .cse16) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (let ((.cse47 (store (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse48 (store (select |c_#memory_$Pointer$.base| .cse48) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse46 v_arrayElimCell_266))) (_ bv1 1))) (= (bvadd (bvneg (select |c_#valid| (select .cse46 v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))))) .cse4) (or (and (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse49 (store (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse50 (store (select |c_#memory_$Pointer$.base| .cse50) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse49 (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)))) .cse8) .cse39 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse51 (store (let ((.cse52 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse52 (store (select |c_#memory_$Pointer$.base| .cse52) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse51 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse53 (store (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse53 (select (select .cse53 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)))))) .cse23)))) (.cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse29 (store (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse30 (store (select |c_#memory_$Pointer$.base| .cse30) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) .cse4))) (and .cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (let ((.cse2 (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1))))) .cse4) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse5 (let ((.cse6 (store (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse5 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg (select |c_#valid| (select .cse5 v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))))) .cse8) (or .cse9 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (and .cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse10 (store (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))) .cse8) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse12 (store (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse14 (store (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse15 (store (select |c_#memory_$Pointer$.base| .cse15) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))))) .cse16) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) .cse9) (or (and (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse17 (store (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse19 (store (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse20 (store (select |c_#memory_$Pointer$.base| .cse20) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)))) .cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse21 (store (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse22 (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1))) .cse8)) .cse23) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse26 (let ((.cse27 (store (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse28 (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse24 (store (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse25 (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (bvadd (bvneg (select |c_#valid| (select .cse26 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg (select |c_#valid| (select .cse26 v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))))))))) is different from false [2022-07-12 19:20:28,409 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse8 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) (.cse23 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|)))) (let ((.cse16 (not .cse23)) (.cse4 (not .cse8))) (let ((.cse9 (let ((.cse39 (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse55 (store (let ((.cse56 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse56 (store (select |c_#memory_$Pointer$.base| .cse56) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse55 (select (select .cse55 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) .cse4))) (and (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse31 (let ((.cse34 (store (let ((.cse35 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse35 (store (select |c_#memory_$Pointer$.base| .cse35) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse34 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_268)))) (_ bv0 1)) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse32 (store (let ((.cse33 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse33 (store (select |c_#memory_$Pointer$.base| .cse33) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse32 (select (select .cse32 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse31 v_arrayElimCell_266))) (_ bv1 1)))))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse36 (let ((.cse37 (store (let ((.cse38 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse38 (store (select |c_#memory_$Pointer$.base| .cse38) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse37 (select (select .cse37 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_268)))) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse36 v_arrayElimCell_266))) (_ bv1 1)))))) .cse8) .cse39 (or (and (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse40 (store (let ((.cse41 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse41 (store (select |c_#memory_$Pointer$.base| .cse41) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse40 (select (select .cse40 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268)))) (_ bv0 1)) (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse42 (store (let ((.cse43 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse43 (store (select |c_#memory_$Pointer$.base| .cse43) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse42 (select (select .cse42 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))))) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse44 (store (let ((.cse45 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse45 (store (select |c_#memory_$Pointer$.base| .cse45) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse44 (select (select .cse44 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268)))) (_ bv0 1))) .cse8) .cse39) .cse16) (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (let ((.cse47 (store (let ((.cse48 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse48 (store (select |c_#memory_$Pointer$.base| .cse48) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse47 (select (select .cse47 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select .cse46 v_arrayElimCell_266))) (_ bv1 1))) (= (bvadd (bvneg (select |c_#valid| (select .cse46 v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))))) .cse4) (or (and (or (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse49 (store (let ((.cse50 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse50 (store (select |c_#memory_$Pointer$.base| .cse50) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse49 (select (select .cse49 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)))) .cse8) .cse39 (forall ((v_arrayElimCell_267 (_ BitVec 32)) (v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse51 (store (let ((.cse52 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse52 (store (select |c_#memory_$Pointer$.base| .cse52) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse51 (select (select .cse51 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| (select (let ((.cse53 (store (let ((.cse54 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse54 (store (select |c_#memory_$Pointer$.base| .cse54) v_arrayElimCell_267 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse53 (select (select .cse53 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)))))) .cse23)))) (.cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse29 (store (let ((.cse30 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse30 (store (select |c_#memory_$Pointer$.base| .cse30) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse29 (select (select .cse29 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) .cse4))) (and .cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_arrayElimCell_269 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (let ((.cse2 (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg (select |c_#valid| (select .cse1 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1))))) .cse4) (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse5 (let ((.cse6 (store (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse7 (store (select |c_#memory_$Pointer$.base| .cse7) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= (bvadd (bvneg (select |c_#valid| (select .cse5 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg (select |c_#valid| (select .cse5 v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))))) .cse8) (or .cse9 (= |c_ULTIMATE.start_sll_circular_insert_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|)) (or (and .cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse10 (store (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse11 (store (select |c_#memory_$Pointer$.base| .cse11) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse10 (select (select .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))) .cse8) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse12 (store (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse12 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse14 (store (let ((.cse15 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse15 (store (select |c_#memory_$Pointer$.base| .cse15) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse14 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))))) .cse16) (or (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) .cse9) (or (and (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse17 (store (let ((.cse18 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse18 (store (select |c_#memory_$Pointer$.base| .cse18) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse17 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse19 (store (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse20 (store (select |c_#memory_$Pointer$.base| .cse20) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse19 (select (select .cse19 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)))) .cse0 (or (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse21 (store (let ((.cse22 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse22 (store (select |c_#memory_$Pointer$.base| .cse22) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse21 (select (select .cse21 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1))) .cse8)) .cse23) (forall ((v_arrayElimCell_266 (_ BitVec 32)) (v_ArrVal_2629 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimCell_268 (_ BitVec 32))) (let ((.cse26 (let ((.cse27 (store (let ((.cse28 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse28 (store (select |c_#memory_$Pointer$.base| .cse28) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse27 (select (select .cse27 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (forall ((v_arrayElimCell_269 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse24 (store (let ((.cse25 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse25 (store (select |c_#memory_$Pointer$.base| .cse25) v_arrayElimCell_266 |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_2629))) (select .cse24 (select (select .cse24 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) v_arrayElimCell_269))) (_ bv1 1)) (_ bv0 1))) (= (bvadd (bvneg (select |c_#valid| (select .cse26 v_arrayElimCell_266))) (_ bv1 1)) (_ bv0 1)) (= (bvadd (bvneg (select |c_#valid| (select .cse26 v_arrayElimCell_268))) (_ bv1 1)) (_ bv0 1))))))))) is different from true