./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:58:18,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:58:18,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:58:18,384 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:58:18,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:58:18,389 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:58:18,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:58:18,394 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:58:18,396 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:58:18,398 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:58:18,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:58:18,401 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:58:18,401 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:58:18,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:58:18,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:58:18,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:58:18,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:58:18,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:58:18,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:58:18,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:58:18,418 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:58:18,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:58:18,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:58:18,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:58:18,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:58:18,423 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:58:18,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:58:18,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:58:18,425 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:58:18,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:58:18,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:58:18,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:58:18,428 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:58:18,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:58:18,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:58:18,429 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:58:18,430 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:58:18,430 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:58:18,430 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:58:18,430 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:58:18,431 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:58:18,432 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:58:18,433 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:58:18,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:58:18,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:58:18,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:58:18,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:58:18,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:58:18,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:58:18,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:58:18,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:58:18,460 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:58:18,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:58:18,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:58:18,461 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:58:18,461 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:58:18,461 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:58:18,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:58:18,462 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:58:18,462 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:58:18,462 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:58:18,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:58:18,462 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:58:18,462 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:58:18,462 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:58:18,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:58:18,463 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:58:18,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:58:18,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:58:18,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:58:18,464 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:58:18,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:58:18,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:58:18,464 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2022-07-14 06:58:18,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:58:18,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:58:18,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:58:18,674 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:58:18,675 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:58:18,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-07-14 06:58:18,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048acc386/b9ccb49b4d1246f2a46dd2ed54e74413/FLAGef91387bf [2022-07-14 06:58:19,150 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:58:19,151 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2022-07-14 06:58:19,158 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048acc386/b9ccb49b4d1246f2a46dd2ed54e74413/FLAGef91387bf [2022-07-14 06:58:19,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/048acc386/b9ccb49b4d1246f2a46dd2ed54e74413 [2022-07-14 06:58:19,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:58:19,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:58:19,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:58:19,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:58:19,173 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:58:19,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2356ae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19, skipping insertion in model container [2022-07-14 06:58:19,174 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,179 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:58:19,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:58:19,434 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-07-14 06:58:19,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:58:19,449 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:58:19,477 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i[24436,24449] [2022-07-14 06:58:19,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:58:19,495 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:58:19,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19 WrapperNode [2022-07-14 06:58:19,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:58:19,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:58:19,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:58:19,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:58:19,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,512 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,543 INFO L137 Inliner]: procedures = 126, calls = 26, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 133 [2022-07-14 06:58:19,544 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:58:19,545 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:58:19,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:58:19,545 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:58:19,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,591 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:58:19,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:58:19,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:58:19,592 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:58:19,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (1/1) ... [2022-07-14 06:58:19,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:58:19,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:19,624 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-14 06:58:19,633 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-14 06:58:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:58:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:58:19,653 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-14 06:58:19,654 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-14 06:58:19,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:58:19,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:58:19,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:58:19,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:58:19,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:58:19,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:58:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:58:19,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:58:19,722 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:58:19,724 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:58:19,953 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:58:19,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:58:19,958 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-14 06:58:19,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:58:19 BoogieIcfgContainer [2022-07-14 06:58:19,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:58:19,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:58:19,963 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:58:19,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:58:19,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:58:19" (1/3) ... [2022-07-14 06:58:19,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b5e20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:58:19, skipping insertion in model container [2022-07-14 06:58:19,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:58:19" (2/3) ... [2022-07-14 06:58:19,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61b5e20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:58:19, skipping insertion in model container [2022-07-14 06:58:19,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:58:19" (3/3) ... [2022-07-14 06:58:19,968 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2022-07-14 06:58:19,993 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:58:19,994 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-14 06:58:20,040 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:58:20,050 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@13691256, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e87444f [2022-07-14 06:58:20,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-14 06:58:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:20,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:58:20,065 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:20,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:58:20,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:20,070 INFO L85 PathProgramCache]: Analyzing trace with hash 894505749, now seen corresponding path program 1 times [2022-07-14 06:58:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:20,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105573723] [2022-07-14 06:58:20,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:20,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,216 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-14 06:58:20,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:20,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105573723] [2022-07-14 06:58:20,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105573723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:20,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:20,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:58:20,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717499728] [2022-07-14 06:58:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:20,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:58:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:20,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:58:20,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:58:20,256 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.8431372549019607) internal successors, (94), 79 states have internal predecessors, (94), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:58:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:20,335 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2022-07-14 06:58:20,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:58:20,338 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-14 06:58:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:20,344 INFO L225 Difference]: With dead ends: 81 [2022-07-14 06:58:20,345 INFO L226 Difference]: Without dead ends: 78 [2022-07-14 06:58:20,346 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-14 06:58:20,350 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:20,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 135 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-14 06:58:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-14 06:58:20,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.653061224489796) internal successors, (81), 74 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2022-07-14 06:58:20,377 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 6 [2022-07-14 06:58:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:20,377 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2022-07-14 06:58:20,378 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-14 06:58:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2022-07-14 06:58:20,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:58:20,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:20,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:58:20,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:58:20,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:20,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:20,379 INFO L85 PathProgramCache]: Analyzing trace with hash 894505750, now seen corresponding path program 1 times [2022-07-14 06:58:20,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:20,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806897637] [2022-07-14 06:58:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:20,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,427 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-14 06:58:20,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:20,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806897637] [2022-07-14 06:58:20,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806897637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:20,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:20,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:58:20,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247157435] [2022-07-14 06:58:20,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:20,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:58:20,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:20,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:58:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:58:20,436 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:58:20,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:20,475 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-14 06:58:20,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:58:20,476 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-14 06:58:20,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:20,482 INFO L225 Difference]: With dead ends: 76 [2022-07-14 06:58:20,482 INFO L226 Difference]: Without dead ends: 76 [2022-07-14 06:58:20,482 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-14 06:58:20,483 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 4 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:20,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 137 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:58:20,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-14 06:58:20,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-07-14 06:58:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-14 06:58:20,489 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2022-07-14 06:58:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:20,490 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-14 06:58:20,490 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-14 06:58:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-14 06:58:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:58:20,490 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:20,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:20,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:58:20,491 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:20,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:20,491 INFO L85 PathProgramCache]: Analyzing trace with hash -835957545, now seen corresponding path program 1 times [2022-07-14 06:58:20,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:20,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63025659] [2022-07-14 06:58:20,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:20,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,596 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-14 06:58:20,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:20,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63025659] [2022-07-14 06:58:20,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63025659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:20,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:20,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:58:20,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968794541] [2022-07-14 06:58:20,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:20,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:58:20,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:20,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:58:20,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:58:20,625 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:58:20,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:20,688 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-07-14 06:58:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:58:20,689 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-14 06:58:20,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:20,690 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:58:20,691 INFO L226 Difference]: Without dead ends: 83 [2022-07-14 06:58:20,692 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-14 06:58:20,692 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 5 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:20,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:20,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-14 06:58:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-07-14 06:58:20,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 50 states have (on average 1.6) internal successors, (80), 73 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2022-07-14 06:58:20,702 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 13 [2022-07-14 06:58:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:20,703 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2022-07-14 06:58:20,703 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-14 06:58:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2022-07-14 06:58:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:58:20,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:20,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:20,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:58:20,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:20,705 INFO L85 PathProgramCache]: Analyzing trace with hash -125034980, now seen corresponding path program 1 times [2022-07-14 06:58:20,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:20,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269869107] [2022-07-14 06:58:20,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:20,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:20,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,807 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-14 06:58:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:20,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269869107] [2022-07-14 06:58:20,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269869107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:20,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:20,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:58:20,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973554403] [2022-07-14 06:58:20,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:20,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:58:20,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:20,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:58:20,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:58:20,809 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:20,907 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2022-07-14 06:58:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:58:20,907 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-14 06:58:20,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:20,909 INFO L225 Difference]: With dead ends: 97 [2022-07-14 06:58:20,909 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 06:58:20,910 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-14 06:58:20,911 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 69 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:20,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 268 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 06:58:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2022-07-14 06:58:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.58) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2022-07-14 06:58:20,916 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 22 [2022-07-14 06:58:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:20,916 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2022-07-14 06:58:20,916 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-14 06:58:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2022-07-14 06:58:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:58:20,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:20,917 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:20,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:58:20,918 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash -125034979, now seen corresponding path program 1 times [2022-07-14 06:58:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:20,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160031724] [2022-07-14 06:58:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:20,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:21,011 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-14 06:58:21,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:21,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160031724] [2022-07-14 06:58:21,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160031724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:21,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:21,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:58:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546878026] [2022-07-14 06:58:21,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:21,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:58:21,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:21,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:58:21,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:58:21,014 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:21,103 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-07-14 06:58:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:58:21,104 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-14 06:58:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:21,105 INFO L225 Difference]: With dead ends: 76 [2022-07-14 06:58:21,105 INFO L226 Difference]: Without dead ends: 76 [2022-07-14 06:58:21,105 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-14 06:58:21,106 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:21,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 277 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-14 06:58:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2022-07-14 06:58:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.56) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-07-14 06:58:21,110 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 22 [2022-07-14 06:58:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:21,110 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-07-14 06:58:21,110 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-14 06:58:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-07-14 06:58:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:58:21,111 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:21,111 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-14 06:58:21,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:58:21,112 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:21,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:21,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454715, now seen corresponding path program 1 times [2022-07-14 06:58:21,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:21,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993574619] [2022-07-14 06:58:21,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:21,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:21,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:21,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:21,224 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-14 06:58:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:21,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993574619] [2022-07-14 06:58:21,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993574619] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:21,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295778940] [2022-07-14 06:58:21,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:21,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:21,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:21,227 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-14 06:58:21,263 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-14 06:58:21,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:21,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:58:21,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:21,359 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-14 06:58:21,514 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:58:21,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-14 06:58:21,533 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-14 06:58:21,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:21,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295778940] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:21,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:58:21,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-07-14 06:58:21,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514379386] [2022-07-14 06:58:21,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:21,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:58:21,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:21,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:58:21,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:58:21,582 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:58:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:21,677 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-07-14 06:58:21,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:58:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-14 06:58:21,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:21,678 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:58:21,678 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:58:21,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:58:21,679 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 67 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:21,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 355 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-07-14 06:58:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:58:21,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 74. [2022-07-14 06:58:21,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.54) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-07-14 06:58:21,683 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 25 [2022-07-14 06:58:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:21,683 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-07-14 06:58:21,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:58:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-07-14 06:58:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:58:21,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:21,684 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-14 06:58:21,704 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-14 06:58:21,901 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-14 06:58:21,901 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:21,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:21,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1180454714, now seen corresponding path program 1 times [2022-07-14 06:58:21,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:21,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379705730] [2022-07-14 06:58:21,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:21,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:21,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:21,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:22,096 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-14 06:58:22,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:22,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379705730] [2022-07-14 06:58:22,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379705730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:22,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260303430] [2022-07-14 06:58:22,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:22,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:22,098 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-14 06:58:22,099 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-14 06:58:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:22,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:58:22,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:22,249 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-14 06:58:22,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:58:22,425 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-14 06:58:22,430 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:58:22,431 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-14 06:58:22,461 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-14 06:58:22,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:22,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260303430] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:22,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:58:22,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2022-07-14 06:58:22,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054402665] [2022-07-14 06:58:22,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:22,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:58:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:22,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:58:22,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:58:22,553 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-14 06:58:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:22,743 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-14 06:58:22,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:58:22,744 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-14 06:58:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:22,745 INFO L225 Difference]: With dead ends: 94 [2022-07-14 06:58:22,745 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 06:58:22,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:58:22,746 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 176 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:22,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 450 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 324 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-07-14 06:58:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 06:58:22,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2022-07-14 06:58:22,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:22,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2022-07-14 06:58:22,750 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 25 [2022-07-14 06:58:22,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:22,750 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2022-07-14 06:58:22,751 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-14 06:58:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2022-07-14 06:58:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:58:22,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:22,752 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:22,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:58:22,952 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-14 06:58:22,952 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:22,953 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866825, now seen corresponding path program 1 times [2022-07-14 06:58:22,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:22,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505488847] [2022-07-14 06:58:22,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:22,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:58:23,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:23,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505488847] [2022-07-14 06:58:23,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505488847] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:23,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:23,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:58:23,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473556060] [2022-07-14 06:58:23,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:23,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:58:23,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:23,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:58:23,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:58:23,041 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:23,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:23,245 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-14 06:58:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:58:23,245 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-14 06:58:23,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:23,246 INFO L225 Difference]: With dead ends: 142 [2022-07-14 06:58:23,246 INFO L226 Difference]: Without dead ends: 142 [2022-07-14 06:58:23,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:58:23,247 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 312 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:23,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 479 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:58:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-14 06:58:23,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 76. [2022-07-14 06:58:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2022-07-14 06:58:23,250 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 30 [2022-07-14 06:58:23,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:23,250 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2022-07-14 06:58:23,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:23,250 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2022-07-14 06:58:23,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:58:23,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:23,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:23,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:58:23,251 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866826, now seen corresponding path program 1 times [2022-07-14 06:58:23,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:23,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310777218] [2022-07-14 06:58:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:23,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:23,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:58:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:23,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310777218] [2022-07-14 06:58:23,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310777218] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:23,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091378200] [2022-07-14 06:58:23,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:23,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:23,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:23,368 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-14 06:58:23,370 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-14 06:58:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:58:23,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:58:23,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:58:23,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091378200] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:23,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:58:23,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-14 06:58:23,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28156817] [2022-07-14 06:58:23,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:23,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:58:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:58:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:58:23,489 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:23,516 INFO L93 Difference]: Finished difference Result 104 states and 117 transitions. [2022-07-14 06:58:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:58:23,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-14 06:58:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:23,517 INFO L225 Difference]: With dead ends: 104 [2022-07-14 06:58:23,517 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:58:23,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:58:23,519 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 117 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:23,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 216 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:58:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:58:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 79. [2022-07-14 06:58:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.5178571428571428) internal successors, (85), 75 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:23,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2022-07-14 06:58:23,532 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 30 [2022-07-14 06:58:23,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:23,533 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2022-07-14 06:58:23,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:23,533 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2022-07-14 06:58:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:58:23,536 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:23,536 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:23,554 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-14 06:58:23,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:23,755 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:23,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:23,755 INFO L85 PathProgramCache]: Analyzing trace with hash 2031866881, now seen corresponding path program 1 times [2022-07-14 06:58:23,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:23,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061808080] [2022-07-14 06:58:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:23,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:23,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:58:23,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:23,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061808080] [2022-07-14 06:58:23,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061808080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:23,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:23,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:58:23,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74988626] [2022-07-14 06:58:23,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:23,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:58:23,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:23,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:58:23,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:58:23,945 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:24,204 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2022-07-14 06:58:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:58:24,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-14 06:58:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:24,206 INFO L225 Difference]: With dead ends: 127 [2022-07-14 06:58:24,206 INFO L226 Difference]: Without dead ends: 127 [2022-07-14 06:58:24,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:58:24,207 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 307 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:24,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 500 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:58:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-14 06:58:24,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 79. [2022-07-14 06:58:24,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 75 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:24,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-14 06:58:24,216 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2022-07-14 06:58:24,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:24,216 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-14 06:58:24,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:24,217 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-14 06:58:24,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:58:24,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:24,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:24,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:58:24,218 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:24,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:24,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829059, now seen corresponding path program 1 times [2022-07-14 06:58:24,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:24,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319746452] [2022-07-14 06:58:24,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:24,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:24,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:58:24,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:24,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319746452] [2022-07-14 06:58:24,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319746452] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:24,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271915404] [2022-07-14 06:58:24,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:24,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:24,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:24,425 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-14 06:58:24,426 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-14 06:58:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:24,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 06:58:24,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:24,522 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-14 06:58:24,564 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:58:24,564 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-14 06:58:24,572 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-14 06:58:24,591 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:24,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:58:24,668 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-14 06:58:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:58:24,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:24,690 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-14 06:58:24,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:58:24,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-14 06:58:24,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_702 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_702) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2022-07-14 06:58:24,707 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:58:24,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-14 06:58:24,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 06:58:24,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-14 06:58:24,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271915404] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:24,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:58:24,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 23 [2022-07-14 06:58:24,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062316978] [2022-07-14 06:58:24,765 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:24,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:58:24,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:24,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:58:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=549, Unknown=2, NotChecked=94, Total=702 [2022-07-14 06:58:24,767 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:25,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:25,323 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2022-07-14 06:58:25,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:58:25,324 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-07-14 06:58:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:25,328 INFO L225 Difference]: With dead ends: 125 [2022-07-14 06:58:25,328 INFO L226 Difference]: Without dead ends: 125 [2022-07-14 06:58:25,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1039, Unknown=2, NotChecked=134, Total=1332 [2022-07-14 06:58:25,330 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 165 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:25,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 896 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:58:25,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-14 06:58:25,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 94. [2022-07-14 06:58:25,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:58:25,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-07-14 06:58:25,337 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2022-07-14 06:58:25,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:25,337 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-07-14 06:58:25,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 20 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-07-14 06:58:25,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:58:25,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:25,340 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:25,359 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-14 06:58:25,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:25,557 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:25,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1922829058, now seen corresponding path program 1 times [2022-07-14 06:58:25,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:25,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154960276] [2022-07-14 06:58:25,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:25,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:25,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:25,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:25,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:58:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:25,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154960276] [2022-07-14 06:58:25,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154960276] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:25,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833299698] [2022-07-14 06:58:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:25,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:25,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:25,868 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:25,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:58:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:25,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 71 conjunts are in the unsatisfiable core [2022-07-14 06:58:25,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:25,972 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-14 06:58:26,178 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:58:26,179 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-14 06:58:26,183 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 11 [2022-07-14 06:58:26,245 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-14 06:58:26,249 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-14 06:58:26,326 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:26,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-14 06:58:26,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 33 treesize of output 33 [2022-07-14 06:58:26,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-14 06:58:26,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-14 06:58:26,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:58:26,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:26,788 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2022-07-14 06:58:26,803 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-07-14 06:58:26,810 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:58:26,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-14 06:58:26,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:58:26,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 06:58:26,817 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 52 treesize of output 44 [2022-07-14 06:58:26,819 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 82 treesize of output 70 [2022-07-14 06:58:26,822 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 34 treesize of output 30 [2022-07-14 06:58:26,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-07-14 06:58:26,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:58:26,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 06:58:26,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:58:26,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 10 [2022-07-14 06:58:27,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833299698] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:27,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:58:27,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-07-14 06:58:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670075599] [2022-07-14 06:58:27,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:27,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 06:58:27,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:27,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 06:58:27,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1945, Unknown=2, NotChecked=178, Total=2256 [2022-07-14 06:58:27,003 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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-14 06:58:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:27,910 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-07-14 06:58:27,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:58:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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 33 [2022-07-14 06:58:27,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:27,911 INFO L225 Difference]: With dead ends: 150 [2022-07-14 06:58:27,911 INFO L226 Difference]: Without dead ends: 150 [2022-07-14 06:58:27,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=263, Invalid=2713, Unknown=2, NotChecked=214, Total=3192 [2022-07-14 06:58:27,912 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 235 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:27,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1402 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:58:27,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-14 06:58:27,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 91. [2022-07-14 06:58:27,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 86 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:58:27,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 101 transitions. [2022-07-14 06:58:27,915 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 101 transitions. Word has length 33 [2022-07-14 06:58:27,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:27,915 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 101 transitions. [2022-07-14 06:58:27,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 31 states have internal predecessors, (53), 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-14 06:58:27,915 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 101 transitions. [2022-07-14 06:58:27,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-14 06:58:27,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:27,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:27,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:58:28,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-14 06:58:28,123 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:28,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1020012727, now seen corresponding path program 2 times [2022-07-14 06:58:28,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:28,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199801298] [2022-07-14 06:58:28,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:28,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 06:58:28,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:28,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199801298] [2022-07-14 06:58:28,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199801298] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:28,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646893143] [2022-07-14 06:58:28,197 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:58:28,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:28,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:28,212 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:28,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:58:28,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:58:28,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:58:28,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:58:28,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:28,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:58:28,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:58:28,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646893143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:28,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:58:28,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-14 06:58:28,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110957167] [2022-07-14 06:58:28,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:28,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:58:28,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:28,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:58:28,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:58:28,359 INFO L87 Difference]: Start difference. First operand 91 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:28,393 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2022-07-14 06:58:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:58:28,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2022-07-14 06:58:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:28,394 INFO L225 Difference]: With dead ends: 89 [2022-07-14 06:58:28,395 INFO L226 Difference]: Without dead ends: 89 [2022-07-14 06:58:28,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:58:28,396 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 206 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:28,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 115 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:58:28,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-14 06:58:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-07-14 06:58:28,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:58:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-07-14 06:58:28,398 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 36 [2022-07-14 06:58:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:28,399 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-07-14 06:58:28,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-07-14 06:58:28,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:58:28,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:28,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:28,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:58:28,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:28,621 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:28,622 INFO L85 PathProgramCache]: Analyzing trace with hash 999795886, now seen corresponding path program 1 times [2022-07-14 06:58:28,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:28,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971725186] [2022-07-14 06:58:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 06:58:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:28,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971725186] [2022-07-14 06:58:28,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971725186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:28,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:28,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:58:28,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044305010] [2022-07-14 06:58:28,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:28,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:58:28,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:28,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:58:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:58:28,721 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-14 06:58:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:28,876 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-07-14 06:58:28,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:58:28,877 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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 40 [2022-07-14 06:58:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:28,878 INFO L225 Difference]: With dead ends: 114 [2022-07-14 06:58:28,878 INFO L226 Difference]: Without dead ends: 114 [2022-07-14 06:58:28,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:58:28,878 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 280 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:28,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 314 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-14 06:58:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2022-07-14 06:58:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.4) internal successors, (98), 87 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:58:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2022-07-14 06:58:28,880 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 40 [2022-07-14 06:58:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:28,880 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2022-07-14 06:58:28,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 9 states have internal predecessors, (34), 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-14 06:58:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2022-07-14 06:58:28,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:58:28,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:28,881 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:28,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:58:28,881 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:28,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:28,881 INFO L85 PathProgramCache]: Analyzing trace with hash 999795887, now seen corresponding path program 1 times [2022-07-14 06:58:28,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:28,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817694356] [2022-07-14 06:58:28,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:28,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:28,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:58:28,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:28,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817694356] [2022-07-14 06:58:28,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817694356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:28,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056164129] [2022-07-14 06:58:28,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:28,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:28,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:28,952 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:28,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:58:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:29,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:58:29,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:29,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 06:58:29,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 06:58:29,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056164129] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:58:29,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:58:29,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 7 [2022-07-14 06:58:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090204021] [2022-07-14 06:58:29,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:29,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:58:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:29,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:58:29,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:58:29,130 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:58:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:29,191 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-07-14 06:58:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:58:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-07-14 06:58:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:29,192 INFO L225 Difference]: With dead ends: 120 [2022-07-14 06:58:29,192 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 06:58:29,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:58:29,193 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 142 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:29,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 250 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:58:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 06:58:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-07-14 06:58:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 107 states have internal predecessors, (129), 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-14 06:58:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 135 transitions. [2022-07-14 06:58:29,196 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 135 transitions. Word has length 40 [2022-07-14 06:58:29,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:29,196 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 135 transitions. [2022-07-14 06:58:29,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:58:29,196 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 135 transitions. [2022-07-14 06:58:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:58:29,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:29,197 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:29,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-14 06:58:29,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:29,413 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 968760597, now seen corresponding path program 1 times [2022-07-14 06:58:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:29,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893575095] [2022-07-14 06:58:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:29,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:29,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:29,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:58:29,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:29,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893575095] [2022-07-14 06:58:29,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893575095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:29,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560893508] [2022-07-14 06:58:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:29,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:29,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:29,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:29,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:58:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:29,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:58:29,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 06:58:29,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 06:58:29,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560893508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:58:29,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:58:29,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-07-14 06:58:29,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234342216] [2022-07-14 06:58:29,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:29,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:58:29,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:29,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:58:29,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:58:29,686 INFO L87 Difference]: Start difference. First operand 112 states and 135 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:58:29,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:29,784 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-07-14 06:58:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:58:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-07-14 06:58:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:29,784 INFO L225 Difference]: With dead ends: 114 [2022-07-14 06:58:29,784 INFO L226 Difference]: Without dead ends: 114 [2022-07-14 06:58:29,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:58:29,785 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 195 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:29,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 265 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:29,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-14 06:58:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2022-07-14 06:58:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 86 states have (on average 1.4186046511627908) internal successors, (122), 103 states have internal predecessors, (122), 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-14 06:58:29,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-07-14 06:58:29,788 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 41 [2022-07-14 06:58:29,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:29,788 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-07-14 06:58:29,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:58:29,788 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-07-14 06:58:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:58:29,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:29,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:29,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:58:29,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 06:58:29,989 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -192932373, now seen corresponding path program 3 times [2022-07-14 06:58:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:29,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128083006] [2022-07-14 06:58:29,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-14 06:58:30,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-14 06:58:30,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:30,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128083006] [2022-07-14 06:58:30,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128083006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:30,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [557384669] [2022-07-14 06:58:30,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:58:30,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:30,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:30,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:30,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:58:30,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-14 06:58:30,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:58:30,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:58:30,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:30,211 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 06:58:30,211 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:58:30,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [557384669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:30,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:58:30,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-14 06:58:30,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377009434] [2022-07-14 06:58:30,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:30,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:58:30,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:30,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:58:30,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:58:30,213 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:58:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:30,220 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2022-07-14 06:58:30,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:58:30,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-07-14 06:58:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:30,221 INFO L225 Difference]: With dead ends: 92 [2022-07-14 06:58:30,221 INFO L226 Difference]: Without dead ends: 92 [2022-07-14 06:58:30,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:58:30,222 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 58 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:30,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:58:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-14 06:58:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-14 06:58:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.4383561643835616) internal successors, (105), 88 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 109 transitions. [2022-07-14 06:58:30,226 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 109 transitions. Word has length 45 [2022-07-14 06:58:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:30,226 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 109 transitions. [2022-07-14 06:58:30,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:58:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 109 transitions. [2022-07-14 06:58:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:58:30,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:30,227 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:30,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:58:30,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 06:58:30,445 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash 884092027, now seen corresponding path program 2 times [2022-07-14 06:58:30,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:30,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27349761] [2022-07-14 06:58:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:30,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 06:58:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:30,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27349761] [2022-07-14 06:58:30,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27349761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:30,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:58:30,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:58:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061530532] [2022-07-14 06:58:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:30,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:58:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:58:30,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:58:30,556 INFO L87 Difference]: Start difference. First operand 92 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:30,711 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2022-07-14 06:58:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:58:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-14 06:58:30,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:30,712 INFO L225 Difference]: With dead ends: 132 [2022-07-14 06:58:30,713 INFO L226 Difference]: Without dead ends: 132 [2022-07-14 06:58:30,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:58:30,713 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 409 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:30,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 294 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:58:30,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-14 06:58:30,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2022-07-14 06:58:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 88 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2022-07-14 06:58:30,726 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 45 [2022-07-14 06:58:30,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:30,726 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2022-07-14 06:58:30,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.6) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:30,726 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2022-07-14 06:58:30,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:58:30,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:30,727 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:30,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:58:30,727 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:30,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:30,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140989, now seen corresponding path program 1 times [2022-07-14 06:58:30,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:30,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639718149] [2022-07-14 06:58:30,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:30,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 06:58:30,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:30,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639718149] [2022-07-14 06:58:30,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639718149] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:30,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599067152] [2022-07-14 06:58:30,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:30,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:30,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:30,794 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:30,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:58:30,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:30,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:58:30,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:58:30,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:58:30,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599067152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:58:30,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:58:30,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-07-14 06:58:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551839711] [2022-07-14 06:58:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:58:30,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:58:30,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:30,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:58:30,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:58:30,961 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:30,989 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2022-07-14 06:58:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:58:30,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-14 06:58:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:30,990 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:58:30,990 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:58:30,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:58:30,991 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 161 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:30,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 117 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:58:30,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:58:30,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-07-14 06:58:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 84 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-14 06:58:30,993 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 48 [2022-07-14 06:58:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:30,993 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-14 06:58:30,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:58:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-14 06:58:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:58:30,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:30,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:31,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:58:31,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:31,209 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:31,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:31,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140934, now seen corresponding path program 1 times [2022-07-14 06:58:31,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:31,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489459984] [2022-07-14 06:58:31,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:31,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:31,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:31,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:31,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:31,552 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:58:31,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489459984] [2022-07-14 06:58:31,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489459984] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:31,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896895794] [2022-07-14 06:58:31,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:31,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:31,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:31,554 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:31,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:58:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:31,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-14 06:58:31,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:31,719 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-14 06:58:31,801 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:58:31,801 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-14 06:58:31,850 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-14 06:58:31,907 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:31,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:58:32,084 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:32,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:58:32,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:58:32,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-14 06:58:32,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 25 treesize of output 13 [2022-07-14 06:58:32,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 06:58:32,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:35,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2022-07-14 06:58:35,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1)) is different from false [2022-07-14 06:58:35,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) is different from false [2022-07-14 06:58:35,857 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-07-14 06:58:35,857 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 29 treesize of output 28 [2022-07-14 06:58:35,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-14 06:58:35,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1754 (Array Int Int)) (v_ArrVal_1753 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1753))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1754)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2022-07-14 06:58:35,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:58:35,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 29 [2022-07-14 06:58:35,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2022-07-14 06:58:35,875 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 108 treesize of output 98 [2022-07-14 06:58:35,877 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 98 treesize of output 94 [2022-07-14 06:58:35,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896895794] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:35,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:58:35,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 39 [2022-07-14 06:58:35,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927864784] [2022-07-14 06:58:35,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:58:35,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-14 06:58:35,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:58:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-14 06:58:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1799, Unknown=54, NotChecked=450, Total=2450 [2022-07-14 06:58:35,976 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:58:37,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:58:37,024 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-07-14 06:58:37,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:58:37,025 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2022-07-14 06:58:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:58:37,025 INFO L225 Difference]: With dead ends: 145 [2022-07-14 06:58:37,025 INFO L226 Difference]: Without dead ends: 145 [2022-07-14 06:58:37,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=380, Invalid=3246, Unknown=54, NotChecked=610, Total=4290 [2022-07-14 06:58:37,027 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 547 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:58:37,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1091 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:58:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-14 06:58:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 87. [2022-07-14 06:58:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:58:37,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-14 06:58:37,029 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 48 [2022-07-14 06:58:37,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:58:37,029 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-14 06:58:37,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 06:58:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-14 06:58:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:58:37,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:58:37,029 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:58:37,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-14 06:58:37,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:37,238 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:58:37,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:58:37,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1246140935, now seen corresponding path program 1 times [2022-07-14 06:58:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:58:37,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208597353] [2022-07-14 06:58:37,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:37,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:58:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:58:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:37,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:58:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:37,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:58:37,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:58:37,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208597353] [2022-07-14 06:58:37,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208597353] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:58:37,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817737280] [2022-07-14 06:58:37,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:58:37,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:58:37,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:58:37,920 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:58:37,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 06:58:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:58:38,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-14 06:58:38,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:58:38,075 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-14 06:58:38,338 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:58:38,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:58:38,342 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-14 06:58:38,400 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-14 06:58:38,404 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-14 06:58:38,486 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:38,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 44 treesize of output 43 [2022-07-14 06:58:38,489 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 33 [2022-07-14 06:58:38,701 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:58:38,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-14 06:58:38,704 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 33 [2022-07-14 06:58:38,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:58:38,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-07-14 06:58:38,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:58:38,795 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 36 treesize of output 31 [2022-07-14 06:58:38,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-14 06:58:38,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2022-07-14 06:58:38,968 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 06:58:38,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:58:41,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|))))))) is different from false [2022-07-14 06:58:41,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))))) is different from false [2022-07-14 06:58:41,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-14 06:58:41,479 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-14 06:58:41,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)))))) is different from false [2022-07-14 06:58:41,532 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ 8 (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))))) is different from false [2022-07-14 06:58:41,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (and (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-14 06:58:41,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int))) (or (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-14 06:58:41,620 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (<= 0 (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4) v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4))) (forall ((v_ArrVal_1902 Int) (v_ArrVal_1898 (Array Int Int)) (v_ArrVal_1897 (Array Int Int)) (v_ArrVal_1896 (Array Int Int)) (v_ArrVal_1895 (Array Int Int)) (v_ArrVal_1901 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1895))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_21| 4))) (<= (+ (select (store (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1896) .cse0 v_ArrVal_1897) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1901) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 8) (select |c_#length| (select (store (select (store .cse2 .cse0 v_ArrVal_1898) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse1 v_ArrVal_1902) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))))) is different from false [2022-07-14 06:58:41,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:58:41,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 84 [2022-07-14 06:58:41,635 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:58:41,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 60 [2022-07-14 06:58:41,638 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 414 treesize of output 392 [2022-07-14 06:58:41,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2178 treesize of output 2144 [2022-07-14 06:58:41,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:58:41,653 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 1978 treesize of output 1914 [2022-07-14 06:58:41,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:58:41,663 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 1834 treesize of output 1746 [2022-07-14 06:58:41,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:58:41,673 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 1666 treesize of output 1634 [2022-07-14 06:58:41,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:58:41,683 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 1560 treesize of output 1470 [2022-07-14 06:58:41,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:58:41,708 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 1306 treesize of output 1242 [2022-07-14 06:58:41,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:58:41,728 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 1168 treesize of output 1134 [2022-07-14 06:59:47,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:47,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-14 06:59:47,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:47,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-07-14 06:59:47,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:47,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2022-07-14 06:59:47,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:47,117 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:47,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-14 06:59:47,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:47,121 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 14 treesize of output 10 [2022-07-14 06:59:47,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817737280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:47,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:59:47,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 47 [2022-07-14 06:59:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492016727] [2022-07-14 06:59:47,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:47,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-14 06:59:47,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:47,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-14 06:59:47,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=2914, Unknown=9, NotChecked=1044, Total=4160 [2022-07-14 06:59:47,292 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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-14 06:59:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:48,602 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-07-14 06:59:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:59:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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 48 [2022-07-14 06:59:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:48,603 INFO L225 Difference]: With dead ends: 124 [2022-07-14 06:59:48,603 INFO L226 Difference]: Without dead ends: 124 [2022-07-14 06:59:48,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=404, Invalid=4453, Unknown=9, NotChecked=1296, Total=6162 [2022-07-14 06:59:48,605 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 654 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 2115 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:48,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [654 Valid, 2115 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1215 Invalid, 0 Unknown, 94 Unchecked, 0.5s Time] [2022-07-14 06:59:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-14 06:59:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 84. [2022-07-14 06:59:48,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 80 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2022-07-14 06:59:48,607 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 48 [2022-07-14 06:59:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:48,607 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2022-07-14 06:59:48,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.7872340425531914) internal successors, (84), 42 states have internal predecessors, (84), 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-14 06:59:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2022-07-14 06:59:48,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:59:48,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:48,607 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:48,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:48,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 06:59:48,808 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:59:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash -74907051, now seen corresponding path program 1 times [2022-07-14 06:59:48,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:48,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411072029] [2022-07-14 06:59:48,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:48,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:48,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:59:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:48,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:59:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 06:59:48,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:48,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411072029] [2022-07-14 06:59:48,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411072029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:48,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529461725] [2022-07-14 06:59:48,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:48,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:48,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:48,900 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:59:48,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 06:59:49,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:49,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:59:49,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 06:59:49,147 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:59:49,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529461725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:59:49,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:59:49,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-07-14 06:59:49,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472838847] [2022-07-14 06:59:49,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:59:49,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:59:49,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:49,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:59:49,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:59:49,149 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:49,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:59:49,186 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-07-14 06:59:49,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:59:49,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-14 06:59:49,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:59:49,187 INFO L225 Difference]: With dead ends: 86 [2022-07-14 06:59:49,187 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 06:59:49,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:59:49,188 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 70 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:59:49,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 191 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:59:49,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 06:59:49,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-14 06:59:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:59:49,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-14 06:59:49,190 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 49 [2022-07-14 06:59:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:59:49,190 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-14 06:59:49,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:59:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-14 06:59:49,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:59:49,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:59:49,191 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:59:49,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:59:49,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 06:59:49,409 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 06:59:49,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:59:49,409 INFO L85 PathProgramCache]: Analyzing trace with hash 836425368, now seen corresponding path program 1 times [2022-07-14 06:59:49,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:59:49,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440214848] [2022-07-14 06:59:49,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:49,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:59:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 06:59:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:50,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:59:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:50,190 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:59:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:59:50,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440214848] [2022-07-14 06:59:50,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440214848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:59:50,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670089837] [2022-07-14 06:59:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:59:50,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:59:50,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:59:50,192 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:59:50,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 06:59:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:59:50,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-14 06:59:50,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:59:50,360 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-14 06:59:50,538 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:59:50,538 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-14 06:59:50,589 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-14 06:59:50,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:59:50,664 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:59:50,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 06:59:50,666 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 10 treesize of output 9 [2022-07-14 06:59:50,888 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:59:50,889 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 58 treesize of output 55 [2022-07-14 06:59:50,891 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 29 treesize of output 21 [2022-07-14 06:59:50,896 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 34 [2022-07-14 06:59:50,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:51,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-07-14 06:59:51,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2022-07-14 06:59:51,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:59:51,023 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 35 treesize of output 34 [2022-07-14 06:59:51,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-14 06:59:51,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2022-07-14 06:59:51,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-07-14 06:59:51,449 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:59:51,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:59:51,716 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_2182)) |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_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_2182)) |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_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 v_ArrVal_2181)) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))) is different from false [2022-07-14 06:59:51,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1)))))) is different from false [2022-07-14 06:59:51,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:51,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,777 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 104 treesize of output 107 [2022-07-14 06:59:51,780 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 39 treesize of output 23 [2022-07-14 06:59:51,811 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:51,818 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,818 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 104 treesize of output 107 [2022-07-14 06:59:51,821 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 39 treesize of output 23 [2022-07-14 06:59:51,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((|#memory_int| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse0 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) is different from false [2022-07-14 06:59:51,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:51,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,871 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 104 treesize of output 107 [2022-07-14 06:59:51,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-14 06:59:51,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:51,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,901 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 104 treesize of output 107 [2022-07-14 06:59:51,905 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 39 treesize of output 23 [2022-07-14 06:59:51,946 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:51,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 107 [2022-07-14 06:59:51,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2022-07-14 06:59:51,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:51,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:52,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:52,001 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 104 treesize of output 107 [2022-07-14 06:59:52,005 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 39 treesize of output 23 [2022-07-14 06:59:52,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:52,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:52,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:52,047 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 104 treesize of output 107 [2022-07-14 06:59:52,051 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 39 treesize of output 23 [2022-07-14 06:59:52,079 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:52,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:59:52,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:52,086 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 104 treesize of output 107 [2022-07-14 06:59:52,090 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 39 treesize of output 23 [2022-07-14 06:59:52,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (<= .cse1 .cse0) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ 4 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))))) is different from false [2022-07-14 06:59:52,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse0 .cse1) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse1 .cse0) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= .cse2 (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) is different from false [2022-07-14 06:59:52,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse1))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))))) is different from false [2022-07-14 06:59:52,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2022-07-14 06:59:52,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) is different from false [2022-07-14 06:59:52,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse1 (select (store (select (store .cse2 .cse1 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))))))) is different from false [2022-07-14 06:59:52,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store .cse0 .cse1 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse1)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4) (+ (select (select .cse2 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-07-14 06:59:52,319 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:59:52,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 41 [2022-07-14 06:59:52,321 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 262 treesize of output 240 [2022-07-14 06:59:52,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:52,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 206 [2022-07-14 06:59:52,327 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:52,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 176 [2022-07-14 06:59:52,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:59:52,346 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 150 treesize of output 134 [2022-07-14 06:59:52,407 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:59:52,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 1 [2022-07-14 06:59:52,411 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:59:52,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 1 [2022-07-14 06:59:52,884 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-14 06:59:52,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670089837] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:59:52,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:59:52,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 28, 29] total 78 [2022-07-14 06:59:52,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039939090] [2022-07-14 06:59:52,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:59:52,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-14 06:59:52,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:59:52,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-14 06:59:52,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4364, Unknown=10, NotChecked=1410, Total=6006 [2022-07-14 06:59:52,887 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 78 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 69 states have internal predecessors, (126), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 06:59:55,248 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (= (select (store (select (store .cse1 .cse2 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) .cse2)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4) (+ (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2175 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0))) is different from false [2022-07-14 06:59:55,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse0)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2175 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= .cse2 (select (store (select (store .cse3 .cse2 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2176))) (= (+ (select (store (select (store .cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2175) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0))) is different from false [2022-07-14 06:59:57,787 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) .cse0))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0)) is different from false [2022-07-14 06:59:59,792 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (and (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= .cse0 (select (store (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 0)) is different from false [2022-07-14 07:00:01,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse1 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse1 |c_ULTIMATE.start_main_~len~0#1|) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4) (+ (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (= (select (store (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) .cse2))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse1))))))) is different from false [2022-07-14 07:00:02,438 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (<= .cse2 .cse1) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) 4) (+ 4 (select (store (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= .cse3 (select (store (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)))))))) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= |c_ULTIMATE.start_main_~s~0#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-14 07:00:03,052 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (not (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= 0 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (let ((.cse2 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~data#1| 1))) (and (<= .cse1 .cse2) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|))) (forall ((v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2182 Int)) (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|)) (<= .cse2 .cse1) (forall ((v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2181 Int)) (= (+ 4 |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset|) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4) v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-07-14 07:00:03,058 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (not (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| |c_ULTIMATE.start_main_~s~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_update_at_~data#1| (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) 4) (= |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (forall ((|#memory_int| (Array Int (Array Int Int))) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store (store |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |#memory_int| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) |c_ULTIMATE.start_sll_circular_update_at_~data#1|)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|) 4))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2)))))) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0))) is different from false [2022-07-14 07:00:03,063 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~len~0#1|) (= (select (select |c_#memory_int| .cse1) 4) (+ |c_ULTIMATE.start_main_~len~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (<= |c_ULTIMATE.start_main_~len~0#1| .cse0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse1)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse2 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1)))))))) is different from false [2022-07-14 07:00:03,068 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (let ((.cse1 (* |c_ULTIMATE.start_main_~len~0#1| 2)) (.cse0 (+ (select (select |c_#memory_int| .cse2) 4) 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (= |c_ULTIMATE.start_main_~s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~s~0#1.base| .cse2)) (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (+ (let ((.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse3 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1) (* |c_ULTIMATE.start_main_~len~0#1| 2))) (forall ((v_ArrVal_2182 Int) (v_ArrVal_2184 (Array Int Int)) (v_ArrVal_2181 Int)) (<= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (let ((.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_24| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_2184) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_2182) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) .cse4 v_ArrVal_2181) |c_ULTIMATE.start_main_~s~0#1.offset|)))) 1))))))))) is different from false [2022-07-14 07:00:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:04,141 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-07-14 07:00:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 07:00:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 69 states have internal predecessors, (126), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2022-07-14 07:00:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:04,142 INFO L225 Difference]: With dead ends: 86 [2022-07-14 07:00:04,142 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 07:00:04,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 20 IntricatePredicates, 1 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=424, Invalid=6608, Unknown=20, NotChecked=3660, Total=10712 [2022-07-14 07:00:04,145 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 136 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 1989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 741 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:04,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1798 Invalid, 1989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1215 Invalid, 0 Unknown, 741 Unchecked, 0.5s Time] [2022-07-14 07:00:04,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 07:00:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-14 07:00:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:04,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-07-14 07:00:04,152 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 52 [2022-07-14 07:00:04,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:04,152 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-07-14 07:00:04,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 69 states have internal predecessors, (126), 4 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-14 07:00:04,152 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-07-14 07:00:04,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 07:00:04,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:04,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:04,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-14 07:00:04,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:04,366 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:04,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash -368684005, now seen corresponding path program 1 times [2022-07-14 07:00:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:04,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418337824] [2022-07-14 07:00:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:04,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 07:00:04,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:04,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418337824] [2022-07-14 07:00:04,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418337824] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:04,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375534653] [2022-07-14 07:00:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:04,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:04,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:00:04,730 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:00:04,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 07:00:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:04,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-14 07:00:04,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:05,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-14 07:00:05,195 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 7 [2022-07-14 07:00:05,270 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 07:00:05,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:05,492 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 46 treesize of output 40 [2022-07-14 07:00:05,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:05,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:05,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-14 07:00:05,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375534653] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:00:05,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:00:05,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13, 12] total 39 [2022-07-14 07:00:05,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399907427] [2022-07-14 07:00:05,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:05,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-14 07:00:05,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:05,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-14 07:00:05,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1368, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 07:00:05,616 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 07:00:06,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:06,472 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2022-07-14 07:00:06,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 07:00:06,472 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2022-07-14 07:00:06,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:06,473 INFO L225 Difference]: With dead ends: 118 [2022-07-14 07:00:06,473 INFO L226 Difference]: Without dead ends: 118 [2022-07-14 07:00:06,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=376, Invalid=2380, Unknown=0, NotChecked=0, Total=2756 [2022-07-14 07:00:06,474 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1009 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:06,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 856 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 07:00:06,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-14 07:00:06,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 88. [2022-07-14 07:00:06,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 84 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:06,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2022-07-14 07:00:06,476 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 59 [2022-07-14 07:00:06,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:06,476 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2022-07-14 07:00:06,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 3.4615384615384617) internal successors, (135), 37 states have internal predecessors, (135), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 07:00:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2022-07-14 07:00:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 07:00:06,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:06,476 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:06,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:06,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:06,677 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:06,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash 2070538002, now seen corresponding path program 2 times [2022-07-14 07:00:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:06,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989557874] [2022-07-14 07:00:06,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:06,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:06,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:06,770 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 07:00:06,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:06,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989557874] [2022-07-14 07:00:06,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989557874] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:06,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635894261] [2022-07-14 07:00:06,771 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:00:06,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:06,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:00:06,772 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:00:06,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 07:00:06,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 07:00:06,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:00:06,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 07:00:06,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 07:00:06,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 07:00:07,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635894261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:00:07,040 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:00:07,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 8 [2022-07-14 07:00:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190640002] [2022-07-14 07:00:07,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:07,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:00:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:00:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:00:07,041 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 07:00:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:07,118 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2022-07-14 07:00:07,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 07:00:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 62 [2022-07-14 07:00:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:07,119 INFO L225 Difference]: With dead ends: 79 [2022-07-14 07:00:07,120 INFO L226 Difference]: Without dead ends: 79 [2022-07-14 07:00:07,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 07:00:07,120 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 143 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:07,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 228 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-14 07:00:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-07-14 07:00:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:07,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2022-07-14 07:00:07,122 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 62 [2022-07-14 07:00:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:07,123 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2022-07-14 07:00:07,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 07:00:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2022-07-14 07:00:07,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 07:00:07,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:07,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:07,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:07,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 07:00:07,324 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash 424234897, now seen corresponding path program 1 times [2022-07-14 07:00:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:07,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262420470] [2022-07-14 07:00:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-14 07:00:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:07,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262420470] [2022-07-14 07:00:07,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262420470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:07,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:07,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:00:07,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552838460] [2022-07-14 07:00:07,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:07,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 07:00:07,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:07,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 07:00:07,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:00:07,414 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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-14 07:00:07,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:07,567 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-07-14 07:00:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:00:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-14 07:00:07,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:07,568 INFO L225 Difference]: With dead ends: 97 [2022-07-14 07:00:07,568 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 07:00:07,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 07:00:07,569 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 187 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:07,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 258 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 07:00:07,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2022-07-14 07:00:07,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 78 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-07-14 07:00:07,570 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 63 [2022-07-14 07:00:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:07,571 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-07-14 07:00:07,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.5) internal successors, (45), 9 states have internal predecessors, (45), 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-14 07:00:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-07-14 07:00:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-14 07:00:07,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:07,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:07,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 07:00:07,571 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:07,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash 424234898, now seen corresponding path program 1 times [2022-07-14 07:00:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:07,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639491855] [2022-07-14 07:00:07,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:07,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 07:00:07,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:07,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639491855] [2022-07-14 07:00:07,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639491855] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:07,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:07,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:00:07,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573421658] [2022-07-14 07:00:07,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:07,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 07:00:07,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:07,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 07:00:07,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:00:07,688 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:07,847 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2022-07-14 07:00:07,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:00:07,847 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2022-07-14 07:00:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:07,848 INFO L225 Difference]: With dead ends: 80 [2022-07-14 07:00:07,848 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 07:00:07,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 07:00:07,848 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 191 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:07,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 201 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:07,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 07:00:07,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-14 07:00:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:07,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-07-14 07:00:07,850 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 63 [2022-07-14 07:00:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:07,850 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-07-14 07:00:07,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.7) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-07-14 07:00:07,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-14 07:00:07,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:07,851 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:07,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 07:00:07,851 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:07,851 INFO L85 PathProgramCache]: Analyzing trace with hash 266413795, now seen corresponding path program 1 times [2022-07-14 07:00:07,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:07,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137700547] [2022-07-14 07:00:07,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:07,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 07:00:07,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:07,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137700547] [2022-07-14 07:00:07,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137700547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:07,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:07,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 07:00:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925943810] [2022-07-14 07:00:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:07,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 07:00:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 07:00:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:00:07,940 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:08,066 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2022-07-14 07:00:08,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:00:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2022-07-14 07:00:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:08,068 INFO L225 Difference]: With dead ends: 80 [2022-07-14 07:00:08,068 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 07:00:08,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 07:00:08,068 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 187 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:08,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 257 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 07:00:08,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-14 07:00:08,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.173913043478261) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:08,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-07-14 07:00:08,070 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 64 [2022-07-14 07:00:08,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:08,071 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-07-14 07:00:08,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 07:00:08,071 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-07-14 07:00:08,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 07:00:08,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:08,071 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:08,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 07:00:08,072 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854879, now seen corresponding path program 1 times [2022-07-14 07:00:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:08,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116840642] [2022-07-14 07:00:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:08,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-14 07:00:08,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:08,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116840642] [2022-07-14 07:00:08,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116840642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:08,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539383246] [2022-07-14 07:00:08,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:08,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:00:08,156 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:00:08,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-14 07:00:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:08,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-14 07:00:08,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:08,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-14 07:00:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 07:00:08,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:08,644 INFO L356 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-07-14 07:00:08,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2022-07-14 07:00:08,696 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-14 07:00:08,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 07:00:08,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-14 07:00:08,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539383246] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:00:08,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:00:08,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 8] total 26 [2022-07-14 07:00:08,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722903034] [2022-07-14 07:00:08,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:08,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 07:00:08,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:08,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 07:00:08,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2022-07-14 07:00:08,743 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:00:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:09,052 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-07-14 07:00:09,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 07:00:09,052 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 66 [2022-07-14 07:00:09,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:09,053 INFO L225 Difference]: With dead ends: 88 [2022-07-14 07:00:09,053 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 07:00:09,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=1317, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 07:00:09,054 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 331 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:09,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 610 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 07:00:09,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 07:00:09,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2022-07-14 07:00:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:09,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2022-07-14 07:00:09,056 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 66 [2022-07-14 07:00:09,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:09,056 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2022-07-14 07:00:09,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.038461538461538) internal successors, (105), 25 states have internal predecessors, (105), 1 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-14 07:00:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2022-07-14 07:00:09,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 07:00:09,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:09,057 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:09,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:09,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 07:00:09,275 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:09,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1706854878, now seen corresponding path program 1 times [2022-07-14 07:00:09,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:09,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502256312] [2022-07-14 07:00:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:09,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:09,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 07:00:09,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:09,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502256312] [2022-07-14 07:00:09,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502256312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:09,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872901578] [2022-07-14 07:00:09,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:09,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:09,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:00:09,814 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:00:09,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 07:00:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:10,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-14 07:00:10,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:10,018 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-14 07:00:10,121 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:00:10,122 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-14 07:00:10,189 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-14 07:00:10,192 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-14 07:00:10,272 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:00:10,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 07:00:10,276 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-14 07:00:10,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-14 07:00:10,497 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-14 07:00:10,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:10,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 07:00:10,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 23 treesize of output 15 [2022-07-14 07:00:10,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-14 07:00:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 07:00:10,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:11,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:11,131 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 32 treesize of output 36 [2022-07-14 07:00:11,254 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-14 07:00:11,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 07:00:12,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:12,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-14 07:00:12,922 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:12,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 07:00:12,942 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 50 treesize of output 42 [2022-07-14 07:00:12,945 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 196 treesize of output 180 [2022-07-14 07:00:12,949 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 176 treesize of output 164 [2022-07-14 07:00:12,951 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 164 treesize of output 158 [2022-07-14 07:00:12,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2022-07-14 07:00:13,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872901578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:13,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:13,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 51 [2022-07-14 07:00:13,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397348770] [2022-07-14 07:00:13,217 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:13,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-14 07:00:13,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:13,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-14 07:00:13,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=4828, Unknown=9, NotChecked=0, Total=5112 [2022-07-14 07:00:13,219 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:00:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:14,711 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-07-14 07:00:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 07:00:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 66 [2022-07-14 07:00:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:14,712 INFO L225 Difference]: With dead ends: 89 [2022-07-14 07:00:14,713 INFO L226 Difference]: Without dead ends: 89 [2022-07-14 07:00:14,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1781 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=667, Invalid=7514, Unknown=9, NotChecked=0, Total=8190 [2022-07-14 07:00:14,715 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 575 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:14,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 887 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 07:00:14,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-14 07:00:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 82. [2022-07-14 07:00:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-07-14 07:00:14,717 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 66 [2022-07-14 07:00:14,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:14,717 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-07-14 07:00:14,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 47 states have internal predecessors, (107), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 07:00:14,717 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-07-14 07:00:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 07:00:14,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:14,718 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:14,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:14,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:14,927 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1372895080, now seen corresponding path program 1 times [2022-07-14 07:00:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:14,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988114026] [2022-07-14 07:00:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:14,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:15,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 07:00:15,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:15,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988114026] [2022-07-14 07:00:15,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988114026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:00:15,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:00:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 07:00:15,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739158395] [2022-07-14 07:00:15,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:00:15,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 07:00:15,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:15,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 07:00:15,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-14 07:00:15,022 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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-14 07:00:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:15,182 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-07-14 07:00:15,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 07:00:15,182 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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 67 [2022-07-14 07:00:15,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:15,184 INFO L225 Difference]: With dead ends: 81 [2022-07-14 07:00:15,184 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 07:00:15,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-14 07:00:15,184 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 172 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:15,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 222 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:00:15,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 07:00:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-14 07:00:15,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 72 states have (on average 1.125) internal successors, (81), 77 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:15,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-07-14 07:00:15,187 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 67 [2022-07-14 07:00:15,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:15,187 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-07-14 07:00:15,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 9 states have internal predecessors, (51), 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-14 07:00:15,188 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-07-14 07:00:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-14 07:00:15,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:15,189 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:15,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 07:00:15,190 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash -795789539, now seen corresponding path program 1 times [2022-07-14 07:00:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:15,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861642974] [2022-07-14 07:00:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 07:00:15,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:15,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861642974] [2022-07-14 07:00:15,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861642974] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:15,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994691344] [2022-07-14 07:00:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:15,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:15,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:00:15,661 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:00:15,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 07:00:15,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:15,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-14 07:00:15,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:15,890 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-14 07:00:15,957 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-14 07:00:15,999 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:00:15,999 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-14 07:00:16,050 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-14 07:00:16,116 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:00:16,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 07:00:16,252 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:00:16,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 07:00:16,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:16,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-14 07:00:16,468 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-14 07:00:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 07:00:16,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:16,989 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-14 07:00:17,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ 1 (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|)) |c_#StackHeapBarrier|))) is different from false [2022-07-14 07:00:17,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|) (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-14 07:00:17,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-14 07:00:17,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_main_~s~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2022-07-14 07:00:17,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2022-07-14 07:00:17,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (<= (+ (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3183) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) is different from false [2022-07-14 07:00:17,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-14 07:00:17,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| Int) (v_ArrVal_3182 (Array Int Int)) (v_ArrVal_3183 (Array Int Int)) (v_ArrVal_3185 Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (<= (+ (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3182))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3183)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_36| 4) v_ArrVal_3185) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|))) is different from false [2022-07-14 07:00:17,062 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:17,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 36 [2022-07-14 07:00:17,065 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 292 treesize of output 274 [2022-07-14 07:00:17,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:00:17,069 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 248 treesize of output 240 [2022-07-14 07:00:17,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:00:17,072 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 230 treesize of output 214 [2022-07-14 07:00:17,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:00:17,076 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 210 treesize of output 192 [2022-07-14 07:00:17,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994691344] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:17,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:00:17,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 37 [2022-07-14 07:00:17,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292247093] [2022-07-14 07:00:17,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:17,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 07:00:17,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:17,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 07:00:17,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1679, Unknown=9, NotChecked=810, Total=2652 [2022-07-14 07:00:17,235 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:17,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:17,932 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-07-14 07:00:17,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 07:00:17,932 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 69 [2022-07-14 07:00:17,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:17,933 INFO L225 Difference]: With dead ends: 86 [2022-07-14 07:00:17,933 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 07:00:17,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 91 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=319, Invalid=2788, Unknown=9, NotChecked=1044, Total=4160 [2022-07-14 07:00:17,934 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 152 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:17,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 679 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 07:00:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 07:00:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2022-07-14 07:00:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 78 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:17,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-07-14 07:00:17,936 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 69 [2022-07-14 07:00:17,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:17,936 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-07-14 07:00:17,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.675675675675676) internal successors, (99), 33 states have internal predecessors, (99), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 07:00:17,936 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-07-14 07:00:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-14 07:00:17,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:17,936 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:17,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:18,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:18,147 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:18,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:18,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1056399479, now seen corresponding path program 1 times [2022-07-14 07:00:18,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:18,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489175762] [2022-07-14 07:00:18,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:18,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:18,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-14 07:00:18,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:18,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489175762] [2022-07-14 07:00:18,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489175762] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:18,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755260163] [2022-07-14 07:00:18,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:18,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:18,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:00:18,476 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:00:18,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-14 07:00:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:18,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-14 07:00:18,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:18,699 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-14 07:00:18,773 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:00:18,777 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-14 07:00:18,837 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-14 07:00:18,896 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:00:18,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-14 07:00:19,009 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 07:00:19,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-14 07:00:19,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-14 07:00:19,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:19,117 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 16 treesize of output 16 [2022-07-14 07:00:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 07:00:19,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:19,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-07-14 07:00:19,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-14 07:00:19,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-14 07:00:19,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_main_~s~0#1.base|))) is different from false [2022-07-14 07:00:19,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-07-14 07:00:19,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3324) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3325) 0)))) is different from false [2022-07-14 07:00:19,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_3324)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4) v_ArrVal_3325) 0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) is different from false [2022-07-14 07:00:19,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3323 (Array Int Int)) (v_ArrVal_3325 Int) (v_ArrVal_3324 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_3323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3324)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_3325) 0)))) is different from false [2022-07-14 07:00:19,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:19,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-07-14 07:00:19,447 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 285 treesize of output 267 [2022-07-14 07:00:19,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:19,475 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 293 treesize of output 283 [2022-07-14 07:00:19,480 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 322 treesize of output 314 [2022-07-14 07:00:19,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:19,490 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 340 treesize of output 333 [2022-07-14 07:00:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 7 not checked. [2022-07-14 07:00:20,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755260163] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:00:20,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:00:20,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 58 [2022-07-14 07:00:20,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585396474] [2022-07-14 07:00:20,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:00:20,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-14 07:00:20,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:00:20,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-14 07:00:20,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2296, Unknown=8, NotChecked=824, Total=3306 [2022-07-14 07:00:20,086 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 07:00:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:00:20,799 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-07-14 07:00:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 07:00:20,800 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 70 [2022-07-14 07:00:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:00:20,800 INFO L225 Difference]: With dead ends: 80 [2022-07-14 07:00:20,800 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 07:00:20,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 66 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=291, Invalid=3273, Unknown=8, NotChecked=984, Total=4556 [2022-07-14 07:00:20,801 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 287 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 652 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 07:00:20,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 841 Invalid, 1413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 743 Invalid, 0 Unknown, 652 Unchecked, 0.3s Time] [2022-07-14 07:00:20,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 07:00:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-07-14 07:00:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1142857142857143) internal successors, (78), 75 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 07:00:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-07-14 07:00:20,803 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 70 [2022-07-14 07:00:20,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:00:20,803 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-07-14 07:00:20,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.310344827586207) internal successors, (134), 51 states have internal predecessors, (134), 4 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 07:00:20,803 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-07-14 07:00:20,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-14 07:00:20,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:00:20,804 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:00:20,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-14 07:00:21,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-14 07:00:21,005 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 25 more)] === [2022-07-14 07:00:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:00:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash 853476134, now seen corresponding path program 1 times [2022-07-14 07:00:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:00:21,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303583816] [2022-07-14 07:00:21,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:21,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:00:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:21,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 07:00:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:21,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 07:00:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 07:00:21,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:00:21,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303583816] [2022-07-14 07:00:21,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303583816] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:00:21,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110229427] [2022-07-14 07:00:21,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:00:21,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:00:21,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:00:21,553 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:00:21,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-14 07:00:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:00:21,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-14 07:00:21,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:00:21,799 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-14 07:00:21,882 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 07:00:21,882 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-14 07:00:21,901 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-14 07:00:21,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 07:00:22,003 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 07:00:22,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-07-14 07:00:22,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-07-14 07:00:22,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:22,326 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 07:00:22,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2022-07-14 07:00:22,336 INFO L356 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2022-07-14 07:00:22,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2022-07-14 07:00:22,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 07:00:22,458 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 07:00:22,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2022-07-14 07:00:22,461 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 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-14 07:00:22,767 INFO L356 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2022-07-14 07:00:22,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2022-07-14 07:00:22,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:00:22,774 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 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 07:00:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 07:00:22,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:00:24,612 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3477 (Array Int Int)) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3476)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_3477) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select .cse1 .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))) is different from false [2022-07-14 07:00:27,178 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (forall ((v_ArrVal_3477 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|)) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-07-14 07:00:29,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int) (v_ArrVal_3471 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4) v_ArrVal_3474)))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int))) (= (select (let ((.cse3 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse3 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-14 07:00:31,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (and (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse1 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.base|) .cse1 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (= (select (select (store .cse2 |c_ULTIMATE.start_main_~s~0#1.base| .cse3) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (not (<= |c_ULTIMATE.start_sll_circular_update_at_#t~mem12#1.offset| |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43|))))))) is different from false [2022-07-14 07:00:32,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse3 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|)) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse2 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (store .cse3 |c_ULTIMATE.start_main_~s~0#1.base| .cse4) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|)))))) is different from false [2022-07-14 07:00:35,560 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~s~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~s~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_main_~s~0#1.offset| (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_3471)) |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_3474)) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_main_~s~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_main_~s~0#1.offset|) (and (= |c_ULTIMATE.start_main_~s~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= .cse2 |c_ULTIMATE.start_main_~s~0#1.base|))))))) is different from false [2022-07-14 07:00:36,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse2 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (or (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) .cse1 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_#res#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select (store .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse3) .cse4) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse4)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)))))) is different from false [2022-07-14 07:00:37,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse0 (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store |c_#memory_$Pointer$.base| .cse5 (store (select |c_#memory_$Pointer$.base| .cse5) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474))))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (and (= (select (select (store .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse1) .cse2) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse4 v_ArrVal_3471)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) (select (store (select (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) .cse4 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse2) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))))))) is different from false [2022-07-14 07:00:38,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse4 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_3471))) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_3477) (select (store (select (store .cse3 .cse1 (store (select .cse3 .cse1) .cse2 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse5) .cse6) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (and (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6))))))) is different from false [2022-07-14 07:00:42,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| Int) (|ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| Int) (v_ArrVal_3476 Int) (v_ArrVal_3474 Int) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| Int)) (let ((.cse5 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store .cse7 .cse8 (store (select .cse7 .cse8) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4) v_ArrVal_3474)))))) (let ((.cse6 (store (select .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (and (= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse0)) (not (<= 0 |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|)) (not (<= |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset| 0)) (and (forall ((v_ArrVal_3477 (Array Int Int)) (v_ArrVal_3471 Int)) (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| 4))) (select (store (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (store .cse1 .cse2 (store (select .cse1 .cse2) .cse3 v_ArrVal_3471))) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_3477) (select (store (select (store .cse4 .cse2 (store (select .cse4 .cse2) .cse3 v_ArrVal_3474)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| 4) v_ArrVal_3476) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store .cse5 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse6) .cse0) |ULTIMATE.start_sll_circular_destroy_~p~0#1.offset|))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_42| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_43| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))))))) is different from false [2022-07-14 07:00:42,655 INFO L356 Elim1Store]: treesize reduction 144, result has 50.0 percent of original size [2022-07-14 07:00:42,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 640 treesize of output 669 [2022-07-14 07:00:42,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 07:00:42,925 INFO L356 Elim1Store]: treesize reduction 339, result has 36.4 percent of original size [2022-07-14 07:00:42,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 6024 treesize of output 2623 [2022-07-14 07:00:43,098 INFO L356 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2022-07-14 07:00:43,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 25199 treesize of output 25049 [2022-07-14 07:00:43,722 INFO L356 Elim1Store]: treesize reduction 236, result has 56.3 percent of original size [2022-07-14 07:00:43,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 25278 treesize of output 25457 [2022-07-14 07:00:43,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 386 treesize of output 368