./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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/dll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:42:46,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:42:46,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:42:46,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:42:46,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:42:46,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:42:46,324 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:42:46,326 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:42:46,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:42:46,331 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:42:46,332 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:42:46,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:42:46,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:42:46,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:42:46,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:42:46,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:42:46,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:42:46,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:42:46,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:42:46,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:42:46,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:42:46,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:42:46,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:42:46,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:42:46,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:42:46,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:42:46,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:42:46,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:42:46,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:42:46,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:42:46,357 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:42:46,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:42:46,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:42:46,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:42:46,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:42:46,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:42:46,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:42:46,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:42:46,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:42:46,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:42:46,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:42:46,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:42:46,389 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:42:46,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:42:46,390 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:42:46,390 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:42:46,391 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:42:46,391 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:42:46,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:42:46,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:42:46,391 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:42:46,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:42:46,392 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:42:46,393 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:42:46,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:42:46,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:42:46,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:42:46,393 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:42:46,393 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:42:46,394 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:42:46,394 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:42:46,394 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:42:46,394 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:42:46,394 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:42:46,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:42:46,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:42:46,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:42:46,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:42:46,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:42:46,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:42:46,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:42:46,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:42:46,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:42:46,396 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:42:46,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:42:46,397 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:42:46,397 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2023-02-16 03:42:46,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:42:46,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:42:46,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:42:46,619 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:42:46,619 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:42:46,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-02-16 03:42:47,816 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:42:48,037 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:42:48,037 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2023-02-16 03:42:48,045 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a975b2670/413f588c85e6433b955c8a7ef79d1c8f/FLAGecf6747e5 [2023-02-16 03:42:48,077 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a975b2670/413f588c85e6433b955c8a7ef79d1c8f [2023-02-16 03:42:48,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:42:48,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:42:48,080 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:42:48,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:42:48,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:42:48,083 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77adbbcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48, skipping insertion in model container [2023-02-16 03:42:48,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,089 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:42:48,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:42:48,373 WARN L237 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/dll2c_insert_equal.i[24877,24890] [2023-02-16 03:42:48,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:42:48,383 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:42:48,427 WARN L237 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/dll2c_insert_equal.i[24877,24890] [2023-02-16 03:42:48,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:42:48,458 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:42:48,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48 WrapperNode [2023-02-16 03:42:48,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:42:48,460 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:42:48,460 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:42:48,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:42:48,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,489 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,520 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2023-02-16 03:42:48,521 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:42:48,521 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:42:48,521 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:42:48,522 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:42:48,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,540 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:42:48,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:42:48,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:42:48,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:42:48,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (1/1) ... [2023-02-16 03:42:48,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:42:48,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:48,579 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) [2023-02-16 03:42:48,584 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 [2023-02-16 03:42:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:42:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:42:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-16 03:42:48,603 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-16 03:42:48,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:42:48,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:42:48,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:42:48,682 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:42:48,683 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:42:49,031 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:42:49,036 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:42:49,037 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 03:42:49,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:42:49 BoogieIcfgContainer [2023-02-16 03:42:49,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:42:49,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:42:49,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:42:49,043 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:42:49,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:42:48" (1/3) ... [2023-02-16 03:42:49,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621eaedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:42:49, skipping insertion in model container [2023-02-16 03:42:49,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:42:48" (2/3) ... [2023-02-16 03:42:49,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@621eaedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:42:49, skipping insertion in model container [2023-02-16 03:42:49,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:42:49" (3/3) ... [2023-02-16 03:42:49,045 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2023-02-16 03:42:49,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:42:49,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2023-02-16 03:42:49,090 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:42:49,095 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79f4f154, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:42:49,095 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-02-16 03:42:49,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 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) [2023-02-16 03:42:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:42:49,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:49,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:42:49,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 896534515, now seen corresponding path program 1 times [2023-02-16 03:42:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:49,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991319307] [2023-02-16 03:42:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:42:49,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:49,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991319307] [2023-02-16 03:42:49,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991319307] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:49,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:49,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:42:49,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990484270] [2023-02-16 03:42:49,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:49,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:42:49,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:49,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:42:49,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:42:49,381 INFO L87 Difference]: Start difference. First operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:42:49,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:49,495 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2023-02-16 03:42:49,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:42:49,497 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 [2023-02-16 03:42:49,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:49,504 INFO L225 Difference]: With dead ends: 151 [2023-02-16 03:42:49,504 INFO L226 Difference]: Without dead ends: 148 [2023-02-16 03:42:49,505 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 [2023-02-16 03:42:49,509 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:49,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 240 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-16 03:42:49,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-02-16 03:42:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 75 states have (on average 2.026666666666667) internal successors, (152), 143 states have internal predecessors, (152), 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) [2023-02-16 03:42:49,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2023-02-16 03:42:49,550 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 6 [2023-02-16 03:42:49,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:49,551 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2023-02-16 03:42:49,551 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) [2023-02-16 03:42:49,551 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2023-02-16 03:42:49,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-16 03:42:49,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:49,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-16 03:42:49,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:42:49,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:49,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 896534514, now seen corresponding path program 1 times [2023-02-16 03:42:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:49,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920442273] [2023-02-16 03:42:49,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:42:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:49,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920442273] [2023-02-16 03:42:49,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920442273] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:49,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:49,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:42:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326382583] [2023-02-16 03:42:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:49,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:42:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:42:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:42:49,626 INFO L87 Difference]: Start difference. First operand 148 states and 158 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) [2023-02-16 03:42:49,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:49,734 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2023-02-16 03:42:49,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:42:49,735 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 [2023-02-16 03:42:49,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:49,738 INFO L225 Difference]: With dead ends: 145 [2023-02-16 03:42:49,738 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 03:42:49,741 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 [2023-02-16 03:42:49,743 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:49,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 229 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:49,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 03:42:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-02-16 03:42:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 140 states have internal predecessors, (149), 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) [2023-02-16 03:42:49,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2023-02-16 03:42:49,760 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 6 [2023-02-16 03:42:49,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:49,761 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2023-02-16 03:42:49,761 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) [2023-02-16 03:42:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2023-02-16 03:42:49,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:42:49,764 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:49,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:49,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:42:49,764 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:49,765 INFO L85 PathProgramCache]: Analyzing trace with hash 976905444, now seen corresponding path program 1 times [2023-02-16 03:42:49,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:49,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610200447] [2023-02-16 03:42:49,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:49,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:42:49,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:49,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610200447] [2023-02-16 03:42:49,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610200447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:49,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:49,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:42:49,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132559237] [2023-02-16 03:42:49,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:49,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:42:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:49,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:42:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:42:49,902 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-16 03:42:50,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:50,010 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2023-02-16 03:42:50,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:42:50,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2023-02-16 03:42:50,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:50,012 INFO L225 Difference]: With dead ends: 156 [2023-02-16 03:42:50,012 INFO L226 Difference]: Without dead ends: 156 [2023-02-16 03:42:50,012 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 [2023-02-16 03:42:50,013 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:50,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:50,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-16 03:42:50,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2023-02-16 03:42:50,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 141 states have internal predecessors, (150), 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) [2023-02-16 03:42:50,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2023-02-16 03:42:50,019 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 14 [2023-02-16 03:42:50,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:50,019 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2023-02-16 03:42:50,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2023-02-16 03:42:50,019 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2023-02-16 03:42:50,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:42:50,020 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:50,020 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:50,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:42:50,020 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:50,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash 302098592, now seen corresponding path program 1 times [2023-02-16 03:42:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:50,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939459019] [2023-02-16 03:42:50,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:50,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:50,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:50,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:50,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939459019] [2023-02-16 03:42:50,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939459019] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:50,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:50,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:42:50,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177029707] [2023-02-16 03:42:50,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:50,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:50,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:50,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:50,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:50,143 INFO L87 Difference]: Start difference. First operand 146 states and 156 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) [2023-02-16 03:42:50,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:50,389 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2023-02-16 03:42:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:50,389 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 24 [2023-02-16 03:42:50,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:50,391 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:42:50,391 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 03:42:50,391 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 [2023-02-16 03:42:50,392 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 21 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:50,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 484 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 03:42:50,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2023-02-16 03:42:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 140 states have internal predecessors, (149), 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) [2023-02-16 03:42:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2023-02-16 03:42:50,397 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 24 [2023-02-16 03:42:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:50,397 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2023-02-16 03:42:50,397 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) [2023-02-16 03:42:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2023-02-16 03:42:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:42:50,398 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:50,398 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:50,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:42:50,398 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash 302098593, now seen corresponding path program 1 times [2023-02-16 03:42:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:50,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631095427] [2023-02-16 03:42:50,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:50,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:50,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:50,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631095427] [2023-02-16 03:42:50,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631095427] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:50,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:50,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:42:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580775800] [2023-02-16 03:42:50,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:50,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:50,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:50,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:50,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:50,656 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2023-02-16 03:42:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:50,910 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2023-02-16 03:42:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:50,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 24 [2023-02-16 03:42:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:50,912 INFO L225 Difference]: With dead ends: 145 [2023-02-16 03:42:50,914 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 03:42:50,914 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 [2023-02-16 03:42:50,916 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 19 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:50,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 508 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:50,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 03:42:50,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-02-16 03:42:50,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 76 states have (on average 1.9473684210526316) internal successors, (148), 139 states have internal predecessors, (148), 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) [2023-02-16 03:42:50,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2023-02-16 03:42:50,925 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 24 [2023-02-16 03:42:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:50,926 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2023-02-16 03:42:50,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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) [2023-02-16 03:42:50,926 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2023-02-16 03:42:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:42:50,927 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:50,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:50,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:42:50,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:50,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029503, now seen corresponding path program 1 times [2023-02-16 03:42:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:50,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879551193] [2023-02-16 03:42:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:51,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:51,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:51,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:51,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:51,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879551193] [2023-02-16 03:42:51,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879551193] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:51,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955304556] [2023-02-16 03:42:51,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:51,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:51,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:51,178 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) [2023-02-16 03:42:51,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 03:42:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:51,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:42:51,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:51,350 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:51,413 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:42:51,501 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:42:51,502 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-16 03:42:51,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:51,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955304556] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:51,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:51,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2023-02-16 03:42:51,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234474114] [2023-02-16 03:42:51,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:51,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:42:51,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:51,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:42:51,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2023-02-16 03:42:51,592 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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) [2023-02-16 03:42:51,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:51,950 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2023-02-16 03:42:51,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:51,950 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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 26 [2023-02-16 03:42:51,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:51,951 INFO L225 Difference]: With dead ends: 169 [2023-02-16 03:42:51,952 INFO L226 Difference]: Without dead ends: 169 [2023-02-16 03:42:51,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2023-02-16 03:42:51,952 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:51,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 457 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 495 Invalid, 0 Unknown, 175 Unchecked, 0.3s Time] [2023-02-16 03:42:51,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-16 03:42:51,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2023-02-16 03:42:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.925) internal successors, (154), 143 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2023-02-16 03:42:51,956 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 26 [2023-02-16 03:42:51,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:51,956 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2023-02-16 03:42:51,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 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) [2023-02-16 03:42:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2023-02-16 03:42:51,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:42:51,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:51,957 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:51,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:52,163 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 [2023-02-16 03:42:52,163 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029502, now seen corresponding path program 1 times [2023-02-16 03:42:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:52,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242126040] [2023-02-16 03:42:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:52,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:52,476 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:52,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:52,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242126040] [2023-02-16 03:42:52,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242126040] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:52,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545855368] [2023-02-16 03:42:52,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:52,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:52,478 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) [2023-02-16 03:42:52,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 03:42:52,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:52,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-16 03:42:52,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:52,575 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:52,583 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:52,643 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_494 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_494))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:42:52,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:52,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:52,688 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:42:52,688 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:52,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-16 03:42:52,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:54,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545855368] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:54,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:54,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 13 [2023-02-16 03:42:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196228131] [2023-02-16 03:42:54,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:54,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:42:54,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:54,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:42:54,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=173, Unknown=1, NotChecked=26, Total=240 [2023-02-16 03:42:54,819 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 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) [2023-02-16 03:42:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:55,117 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2023-02-16 03:42:55,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:42:55,118 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 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 26 [2023-02-16 03:42:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:55,119 INFO L225 Difference]: With dead ends: 151 [2023-02-16 03:42:55,119 INFO L226 Difference]: Without dead ends: 151 [2023-02-16 03:42:55,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=56, Invalid=219, Unknown=1, NotChecked=30, Total=306 [2023-02-16 03:42:55,120 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 8 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:55,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 658 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 558 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2023-02-16 03:42:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-16 03:42:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2023-02-16 03:42:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9125) internal successors, (153), 143 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2023-02-16 03:42:55,122 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 26 [2023-02-16 03:42:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:55,123 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2023-02-16 03:42:55,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 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) [2023-02-16 03:42:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2023-02-16 03:42:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:42:55,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:55,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:55,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:55,329 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 [2023-02-16 03:42:55,330 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:55,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:55,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1908047191, now seen corresponding path program 1 times [2023-02-16 03:42:55,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:55,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538551700] [2023-02-16 03:42:55,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:55,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:55,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:55,472 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:55,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:55,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538551700] [2023-02-16 03:42:55,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538551700] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:55,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202096806] [2023-02-16 03:42:55,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:55,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:55,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:55,474 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) [2023-02-16 03:42:55,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 03:42:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:55,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:42:55,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:55,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:55,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202096806] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:42:55,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:42:55,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2023-02-16 03:42:55,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504775208] [2023-02-16 03:42:55,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:55,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:42:55,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:55,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:42:55,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:42:55,676 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:42:55,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:55,808 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2023-02-16 03:42:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:55,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 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 28 [2023-02-16 03:42:55,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:55,809 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:42:55,810 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:42:55,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:55,810 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:55,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 750 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:42:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:42:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2023-02-16 03:42:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9) internal successors, (152), 143 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2023-02-16 03:42:55,813 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2023-02-16 03:42:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:55,814 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2023-02-16 03:42:55,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:42:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2023-02-16 03:42:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:42:55,814 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:55,814 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:55,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:56,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:56,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:56,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:56,021 INFO L85 PathProgramCache]: Analyzing trace with hash -984859886, now seen corresponding path program 1 times [2023-02-16 03:42:56,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:56,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970717706] [2023-02-16 03:42:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:56,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:56,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970717706] [2023-02-16 03:42:56,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970717706] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:56,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253833728] [2023-02-16 03:42:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:56,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:56,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:56,090 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) [2023-02-16 03:42:56,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 03:42:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:42:56,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:56,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:56,225 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:42:56,225 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-02-16 03:42:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:56,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253833728] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:42:56,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:42:56,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2023-02-16 03:42:56,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605594837] [2023-02-16 03:42:56,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:56,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:42:56,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:56,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:42:56,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:42:56,242 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:56,445 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2023-02-16 03:42:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:42:56,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2023-02-16 03:42:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:56,447 INFO L225 Difference]: With dead ends: 154 [2023-02-16 03:42:56,447 INFO L226 Difference]: Without dead ends: 154 [2023-02-16 03:42:56,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:56,447 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 11 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:56,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 486 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-16 03:42:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2023-02-16 03:42:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.891566265060241) internal successors, (157), 146 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2023-02-16 03:42:56,450 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2023-02-16 03:42:56,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:56,451 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2023-02-16 03:42:56,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:42:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2023-02-16 03:42:56,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:42:56,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:56,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:56,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:56,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:56,658 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:56,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash -984859885, now seen corresponding path program 1 times [2023-02-16 03:42:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:56,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764046261] [2023-02-16 03:42:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:56,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764046261] [2023-02-16 03:42:56,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764046261] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:56,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042964306] [2023-02-16 03:42:56,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:56,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:56,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:56,862 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) [2023-02-16 03:42:56,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 03:42:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:56,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 03:42:56,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:57,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:57,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:42:57,069 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 24 [2023-02-16 03:42:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:57,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042964306] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:42:57,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:42:57,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2023-02-16 03:42:57,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236880250] [2023-02-16 03:42:57,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:57,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:42:57,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:57,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:42:57,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:42:57,177 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:42:57,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:57,412 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2023-02-16 03:42:57,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:42:57,413 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2023-02-16 03:42:57,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:57,414 INFO L225 Difference]: With dead ends: 159 [2023-02-16 03:42:57,414 INFO L226 Difference]: Without dead ends: 159 [2023-02-16 03:42:57,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:42:57,414 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 28 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:57,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1183 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:57,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-16 03:42:57,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2023-02-16 03:42:57,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.8795180722891567) internal successors, (156), 146 states have internal predecessors, (156), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2023-02-16 03:42:57,417 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 29 [2023-02-16 03:42:57,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:57,417 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2023-02-16 03:42:57,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-16 03:42:57,418 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2023-02-16 03:42:57,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:42:57,418 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:57,418 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:57,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:42:57,624 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,SelfDestructingSolverStorable9 [2023-02-16 03:42:57,624 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash -465885389, now seen corresponding path program 1 times [2023-02-16 03:42:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:57,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247699076] [2023-02-16 03:42:57,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:57,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:57,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:57,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:42:57,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:57,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247699076] [2023-02-16 03:42:57,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247699076] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:57,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:57,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:42:57,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781481596] [2023-02-16 03:42:57,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:57,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:42:57,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:57,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:42:57,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:57,743 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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) [2023-02-16 03:42:58,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:58,063 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2023-02-16 03:42:58,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:42:58,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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 [2023-02-16 03:42:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:58,065 INFO L225 Difference]: With dead ends: 152 [2023-02-16 03:42:58,065 INFO L226 Difference]: Without dead ends: 152 [2023-02-16 03:42:58,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:42:58,065 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:58,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 542 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:42:58,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-16 03:42:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2023-02-16 03:42:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 145 states have internal predecessors, (155), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:58,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2023-02-16 03:42:58,068 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2023-02-16 03:42:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:58,069 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2023-02-16 03:42:58,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 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) [2023-02-16 03:42:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2023-02-16 03:42:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:42:58,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:58,069 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:58,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:42:58,070 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash -465885388, now seen corresponding path program 1 times [2023-02-16 03:42:58,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:58,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536034933] [2023-02-16 03:42:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:42:58,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:58,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536034933] [2023-02-16 03:42:58,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536034933] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:58,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:42:58,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:42:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133168557] [2023-02-16 03:42:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:58,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:42:58,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:58,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:42:58,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:42:58,256 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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) [2023-02-16 03:42:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:58,506 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2023-02-16 03:42:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:42:58,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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 [2023-02-16 03:42:58,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:58,507 INFO L225 Difference]: With dead ends: 150 [2023-02-16 03:42:58,507 INFO L226 Difference]: Without dead ends: 150 [2023-02-16 03:42:58,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:42:58,507 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:58,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 572 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:42:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-16 03:42:58,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2023-02-16 03:42:58,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.855421686746988) internal successors, (154), 144 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-16 03:42:58,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2023-02-16 03:42:58,510 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 30 [2023-02-16 03:42:58,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:58,510 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2023-02-16 03:42:58,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 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) [2023-02-16 03:42:58,510 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2023-02-16 03:42:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:42:58,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:58,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:58,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:42:58,511 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:58,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1959133359, now seen corresponding path program 1 times [2023-02-16 03:42:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:58,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152244040] [2023-02-16 03:42:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-16 03:42:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,620 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-16 03:42:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:58,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152244040] [2023-02-16 03:42:58,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152244040] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:58,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330418984] [2023-02-16 03:42:58,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:58,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:58,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:58,622 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) [2023-02-16 03:42:58,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 03:42:58,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:58,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:42:58,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:42:58,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:42:58,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330418984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:42:58,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:42:58,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2023-02-16 03:42:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773840328] [2023-02-16 03:42:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:42:58,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:42:58,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:42:58,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:42:58,787 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2023-02-16 03:42:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:42:58,795 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2023-02-16 03:42:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:42:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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 41 [2023-02-16 03:42:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:42:58,796 INFO L225 Difference]: With dead ends: 138 [2023-02-16 03:42:58,796 INFO L226 Difference]: Without dead ends: 138 [2023-02-16 03:42:58,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:42:58,797 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:42:58,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:42:58,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-16 03:42:58,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2023-02-16 03:42:58,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 133 states have internal predecessors, (140), 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) [2023-02-16 03:42:58,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2023-02-16 03:42:58,800 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 41 [2023-02-16 03:42:58,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:42:58,801 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2023-02-16 03:42:58,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 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) [2023-02-16 03:42:58,801 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2023-02-16 03:42:58,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:42:58,804 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:42:58,804 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:42:58,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-02-16 03:42:59,009 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 [2023-02-16 03:42:59,010 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:42:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:42:59,011 INFO L85 PathProgramCache]: Analyzing trace with hash -930567857, now seen corresponding path program 1 times [2023-02-16 03:42:59,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:42:59,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017402684] [2023-02-16 03:42:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:59,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:42:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:59,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:42:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:59,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:42:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:59,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:42:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 03:42:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:42:59,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017402684] [2023-02-16 03:42:59,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017402684] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:59,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676919002] [2023-02-16 03:42:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:42:59,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:42:59,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:42:59,347 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) [2023-02-16 03:42:59,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 03:42:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:42:59,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-16 03:42:59,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:42:59,512 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:59,519 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:59,531 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1583))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:42:59,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:59,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:59,572 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:42:59,577 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1584 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1584))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:42:59,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:42:59,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:59,625 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-16 03:42:59,643 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:42:59,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:42:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2023-02-16 03:42:59,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:42:59,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676919002] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:42:59,778 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:42:59,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-16 03:42:59,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283435247] [2023-02-16 03:42:59,778 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:42:59,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:42:59,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:42:59,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:42:59,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-16 03:42:59,779 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-16 03:43:00,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:00,053 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2023-02-16 03:43:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:43:00,054 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2023-02-16 03:43:00,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:00,054 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:43:00,054 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 03:43:00,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-16 03:43:00,055 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 329 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 444 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:00,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 210 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 274 Invalid, 0 Unknown, 444 Unchecked, 0.2s Time] [2023-02-16 03:43:00,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 03:43:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2023-02-16 03:43:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 123 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2023-02-16 03:43:00,058 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 43 [2023-02-16 03:43:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:00,058 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2023-02-16 03:43:00,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-16 03:43:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2023-02-16 03:43:00,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-16 03:43:00,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:00,059 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:00,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:00,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:00,265 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:00,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:00,265 INFO L85 PathProgramCache]: Analyzing trace with hash -930567856, now seen corresponding path program 1 times [2023-02-16 03:43:00,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:00,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479875033] [2023-02-16 03:43:00,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:00,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:00,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 03:43:00,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:00,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479875033] [2023-02-16 03:43:00,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479875033] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:00,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244068422] [2023-02-16 03:43:00,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:00,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:00,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:00,762 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) [2023-02-16 03:43:00,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 03:43:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:00,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:43:00,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:00,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:00,970 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:00,986 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:43:01,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:01,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:01,039 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:01,048 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1824 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1824))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:43:01,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:01,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:01,139 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:01,146 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1825 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1825))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:43:01,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:01,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:01,190 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-16 03:43:01,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:01,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244068422] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:01,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:01,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2023-02-16 03:43:01,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899784941] [2023-02-16 03:43:01,264 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:01,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-16 03:43:01,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:01,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-16 03:43:01,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2023-02-16 03:43:01,265 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:43:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:01,609 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2023-02-16 03:43:01,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:43:01,609 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2023-02-16 03:43:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:01,610 INFO L225 Difference]: With dead ends: 136 [2023-02-16 03:43:01,610 INFO L226 Difference]: Without dead ends: 136 [2023-02-16 03:43:01,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=335, Unknown=3, NotChecked=120, Total=552 [2023-02-16 03:43:01,611 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 514 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 414 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:01,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 267 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 390 Invalid, 0 Unknown, 414 Unchecked, 0.3s Time] [2023-02-16 03:43:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-16 03:43:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2023-02-16 03:43:01,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 113 states have internal predecessors, (120), 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) [2023-02-16 03:43:01,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2023-02-16 03:43:01,613 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 43 [2023-02-16 03:43:01,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:01,613 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2023-02-16 03:43:01,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:43:01,614 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2023-02-16 03:43:01,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:43:01,614 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:01,614 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:01,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:01,820 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,SelfDestructingSolverStorable14 [2023-02-16 03:43:01,821 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:01,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:01,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883970, now seen corresponding path program 1 times [2023-02-16 03:43:01,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:01,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008440320] [2023-02-16 03:43:01,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:01,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:02,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:02,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-16 03:43:02,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:02,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008440320] [2023-02-16 03:43:02,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008440320] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:02,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045628970] [2023-02-16 03:43:02,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:02,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:02,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:02,479 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) [2023-02-16 03:43:02,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 03:43:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:02,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-16 03:43:02,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:02,724 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:02,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-16 03:43:02,972 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)) (exists ((v_ArrVal_2065 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2065))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:43:02,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:02,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:43:02,997 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-16 03:43:02,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:43:03,045 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:43:03,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:03,103 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2071 (Array Int Int)) (|v_node_create_~temp~0#1.base_52| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_52| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_52| v_ArrVal_2071) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_52| |c_#StackHeapBarrier|)))) is different from false [2023-02-16 03:43:03,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045628970] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:03,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:03,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2023-02-16 03:43:03,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005525781] [2023-02-16 03:43:03,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:03,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 03:43:03,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:03,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 03:43:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=623, Unknown=3, NotChecked=102, Total=812 [2023-02-16 03:43:03,106 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:03,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:03,958 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2023-02-16 03:43:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:43:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-16 03:43:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:03,960 INFO L225 Difference]: With dead ends: 223 [2023-02-16 03:43:03,960 INFO L226 Difference]: Without dead ends: 223 [2023-02-16 03:43:03,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=1127, Unknown=5, NotChecked=142, Total=1482 [2023-02-16 03:43:03,961 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1167 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:03,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 768 Invalid, 1410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1153 Invalid, 3 Unknown, 235 Unchecked, 0.6s Time] [2023-02-16 03:43:03,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-16 03:43:03,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 125. [2023-02-16 03:43:03,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 120 states have internal predecessors, (137), 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) [2023-02-16 03:43:03,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2023-02-16 03:43:03,964 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 46 [2023-02-16 03:43:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:03,965 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2023-02-16 03:43:03,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2023-02-16 03:43:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:43:03,965 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:03,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:03,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:04,166 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,SelfDestructingSolverStorable15 [2023-02-16 03:43:04,166 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:04,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:04,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883971, now seen corresponding path program 1 times [2023-02-16 03:43:04,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:04,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237371689] [2023-02-16 03:43:04,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:04,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:04,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:05,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237371689] [2023-02-16 03:43:05,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237371689] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:05,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177860448] [2023-02-16 03:43:05,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:05,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:05,254 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) [2023-02-16 03:43:05,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 03:43:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:05,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-16 03:43:05,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:05,501 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:05,506 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:05,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-16 03:43:05,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:05,949 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2312 (Array Int Int)) (v_ArrVal_2311 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2311)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2312)))) is different from true [2023-02-16 03:43:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:05,991 INFO L350 Elim1Store]: Elim1 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 21 [2023-02-16 03:43:05,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:05,998 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 25 [2023-02-16 03:43:06,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:06,002 INFO L350 Elim1Store]: Elim1 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 18 treesize of output 13 [2023-02-16 03:43:06,007 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-16 03:43:06,007 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2023-02-16 03:43:06,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-16 03:43:06,059 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-16 03:43:06,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:06,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177860448] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:06,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:06,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2023-02-16 03:43:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136570490] [2023-02-16 03:43:06,945 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:06,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:43:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:43:06,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=953, Unknown=1, NotChecked=62, Total=1122 [2023-02-16 03:43:06,955 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:08,119 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2023-02-16 03:43:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:43:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2023-02-16 03:43:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:08,121 INFO L225 Difference]: With dead ends: 204 [2023-02-16 03:43:08,121 INFO L226 Difference]: Without dead ends: 204 [2023-02-16 03:43:08,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=213, Invalid=1682, Unknown=1, NotChecked=84, Total=1980 [2023-02-16 03:43:08,122 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 367 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 214 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:08,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 897 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1489 Invalid, 0 Unknown, 214 Unchecked, 0.8s Time] [2023-02-16 03:43:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-16 03:43:08,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 125. [2023-02-16 03:43:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6265060240963856) internal successors, (135), 120 states have internal predecessors, (135), 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) [2023-02-16 03:43:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2023-02-16 03:43:08,125 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 46 [2023-02-16 03:43:08,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:08,126 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2023-02-16 03:43:08,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 2.4814814814814814) internal successors, (67), 26 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-16 03:43:08,126 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2023-02-16 03:43:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:43:08,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:08,126 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:08,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:08,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-16 03:43:08,327 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:08,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1771238793, now seen corresponding path program 1 times [2023-02-16 03:43:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:08,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306496590] [2023-02-16 03:43:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:08,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:43:08,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:08,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306496590] [2023-02-16 03:43:08,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306496590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:08,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:08,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:43:08,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151021422] [2023-02-16 03:43:08,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:08,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:43:08,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:08,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:43:08,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:43:08,402 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:08,478 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2023-02-16 03:43:08,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:43:08,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2023-02-16 03:43:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:08,480 INFO L225 Difference]: With dead ends: 164 [2023-02-16 03:43:08,480 INFO L226 Difference]: Without dead ends: 164 [2023-02-16 03:43:08,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:43:08,480 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 77 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:08,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 258 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:08,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-16 03:43:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 121. [2023-02-16 03:43:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 116 states have internal predecessors, (124), 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) [2023-02-16 03:43:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2023-02-16 03:43:08,484 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 47 [2023-02-16 03:43:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:08,484 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2023-02-16 03:43:08,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:08,484 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2023-02-16 03:43:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 03:43:08,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:08,485 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:08,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 03:43:08,485 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:08,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997608, now seen corresponding path program 1 times [2023-02-16 03:43:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:08,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276260489] [2023-02-16 03:43:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:08,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:08,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-16 03:43:08,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:08,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276260489] [2023-02-16 03:43:08,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276260489] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:08,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:08,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:08,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594305700] [2023-02-16 03:43:08,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:08,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:08,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:08,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:08,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:08,600 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:08,762 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2023-02-16 03:43:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:08,763 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2023-02-16 03:43:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:08,764 INFO L225 Difference]: With dead ends: 133 [2023-02-16 03:43:08,764 INFO L226 Difference]: Without dead ends: 133 [2023-02-16 03:43:08,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:08,764 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 85 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:08,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 307 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:08,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-16 03:43:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2023-02-16 03:43:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-02-16 03:43:08,766 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 49 [2023-02-16 03:43:08,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:08,766 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-02-16 03:43:08,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-02-16 03:43:08,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 03:43:08,767 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:08,767 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:08,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-16 03:43:08,767 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:08,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997607, now seen corresponding path program 1 times [2023-02-16 03:43:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:08,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047498275] [2023-02-16 03:43:08,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:08,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:43:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:08,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047498275] [2023-02-16 03:43:08,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047498275] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:08,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:08,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:43:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371788073] [2023-02-16 03:43:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:08,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:43:08,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:08,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:43:08,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:43:08,862 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:08,936 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2023-02-16 03:43:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:43:08,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2023-02-16 03:43:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:08,937 INFO L225 Difference]: With dead ends: 114 [2023-02-16 03:43:08,937 INFO L226 Difference]: Without dead ends: 114 [2023-02-16 03:43:08,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:43:08,937 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:08,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 277 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:08,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-16 03:43:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-16 03:43:08,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 109 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-16 03:43:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2023-02-16 03:43:08,940 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 49 [2023-02-16 03:43:08,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:08,940 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2023-02-16 03:43:08,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2023-02-16 03:43:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 03:43:08,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:08,941 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:08,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-16 03:43:08,941 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1351857860, now seen corresponding path program 1 times [2023-02-16 03:43:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:08,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699737586] [2023-02-16 03:43:08,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:08,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:09,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:43:09,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:09,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699737586] [2023-02-16 03:43:09,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699737586] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:09,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:09,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728494750] [2023-02-16 03:43:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:09,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:43:09,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:09,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:43:09,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:43:09,050 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:09,129 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2023-02-16 03:43:09,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:43:09,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2023-02-16 03:43:09,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:09,130 INFO L225 Difference]: With dead ends: 111 [2023-02-16 03:43:09,130 INFO L226 Difference]: Without dead ends: 111 [2023-02-16 03:43:09,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:09,131 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 262 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:09,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:09,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-16 03:43:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-16 03:43:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 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) [2023-02-16 03:43:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2023-02-16 03:43:09,133 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 49 [2023-02-16 03:43:09,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:09,133 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2023-02-16 03:43:09,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:43:09,134 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2023-02-16 03:43:09,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 03:43:09,134 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:09,134 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:09,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 03:43:09,134 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:09,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:09,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077693, now seen corresponding path program 1 times [2023-02-16 03:43:09,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:09,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943443891] [2023-02-16 03:43:09,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:09,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:43:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:09,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943443891] [2023-02-16 03:43:09,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943443891] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:09,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:09,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:43:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537599321] [2023-02-16 03:43:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:09,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:43:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:09,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:43:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:43:09,213 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:09,327 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2023-02-16 03:43:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:43:09,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-02-16 03:43:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:09,328 INFO L225 Difference]: With dead ends: 169 [2023-02-16 03:43:09,328 INFO L226 Difference]: Without dead ends: 169 [2023-02-16 03:43:09,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:43:09,329 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 163 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:09,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 215 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-16 03:43:09,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 110. [2023-02-16 03:43:09,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 105 states have internal predecessors, (111), 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) [2023-02-16 03:43:09,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2023-02-16 03:43:09,331 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 50 [2023-02-16 03:43:09,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:09,331 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2023-02-16 03:43:09,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:09,331 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2023-02-16 03:43:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-16 03:43:09,331 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:09,331 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:09,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 03:43:09,332 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077694, now seen corresponding path program 1 times [2023-02-16 03:43:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23777843] [2023-02-16 03:43:09,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:09,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:09,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23777843] [2023-02-16 03:43:10,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23777843] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:10,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792464516] [2023-02-16 03:43:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:10,294 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) [2023-02-16 03:43:10,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 03:43:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:10,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-16 03:43:10,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:43:10,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:43:10,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792464516] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:10,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:43:10,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [20] total 22 [2023-02-16 03:43:10,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175342534] [2023-02-16 03:43:10,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:10,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:43:10,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:10,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:43:10,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2023-02-16 03:43:10,576 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:10,654 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2023-02-16 03:43:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:43:10,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2023-02-16 03:43:10,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:10,655 INFO L225 Difference]: With dead ends: 109 [2023-02-16 03:43:10,655 INFO L226 Difference]: Without dead ends: 109 [2023-02-16 03:43:10,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:43:10,656 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:10,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 165 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:43:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-16 03:43:10,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-16 03:43:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 104 states have internal predecessors, (110), 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) [2023-02-16 03:43:10,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2023-02-16 03:43:10,658 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 50 [2023-02-16 03:43:10,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:10,658 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2023-02-16 03:43:10,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2023-02-16 03:43:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:43:10,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:10,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:10,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:10,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-16 03:43:10,865 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:10,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -2055329845, now seen corresponding path program 1 times [2023-02-16 03:43:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:10,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392257913] [2023-02-16 03:43:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:10,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,053 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:43:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:11,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392257913] [2023-02-16 03:43:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392257913] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:43:11,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:43:11,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:43:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548942777] [2023-02-16 03:43:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:43:11,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:43:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:11,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:43:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:43:11,056 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:11,242 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2023-02-16 03:43:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:43:11,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2023-02-16 03:43:11,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:11,243 INFO L225 Difference]: With dead ends: 103 [2023-02-16 03:43:11,243 INFO L226 Difference]: Without dead ends: 103 [2023-02-16 03:43:11,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:43:11,244 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:11,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:43:11,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-02-16 03:43:11,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-02-16 03:43:11,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 98 states have internal predecessors, (104), 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) [2023-02-16 03:43:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2023-02-16 03:43:11,246 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 51 [2023-02-16 03:43:11,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:11,246 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2023-02-16 03:43:11,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:43:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2023-02-16 03:43:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 03:43:11,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:11,246 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:11,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-16 03:43:11,246 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:11,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:11,247 INFO L85 PathProgramCache]: Analyzing trace with hash 512975501, now seen corresponding path program 1 times [2023-02-16 03:43:11,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:11,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615237978] [2023-02-16 03:43:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:11,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,624 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:12,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615237978] [2023-02-16 03:43:12,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615237978] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:12,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840511576] [2023-02-16 03:43:12,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:12,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:12,641 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) [2023-02-16 03:43:12,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 03:43:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:12,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 94 conjunts are in the unsatisfiable core [2023-02-16 03:43:12,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:12,943 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:13,153 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:13,153 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:13,251 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:13,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:13,331 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 34 [2023-02-16 03:43:13,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:13,452 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 36 [2023-02-16 03:43:13,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:13,511 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:13,648 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:43:13,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-02-16 03:43:13,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:43:13,779 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3721 (Array Int Int)) (v_ArrVal_3722 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3722)) (= (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|)) |c_#valid|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3721)))) is different from true [2023-02-16 03:43:13,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:13,825 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:13,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2023-02-16 03:43:13,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:13,831 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:13,853 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2023-02-16 03:43:13,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2023-02-16 03:43:13,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:14,009 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:43:14,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-02-16 03:43:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:43:14,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:14,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840511576] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:14,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:14,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2023-02-16 03:43:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355357651] [2023-02-16 03:43:14,236 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:14,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-16 03:43:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:14,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-16 03:43:14,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=2084, Unknown=1, NotChecked=92, Total=2352 [2023-02-16 03:43:14,237 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:43:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:16,125 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2023-02-16 03:43:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-16 03:43:16,125 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-16 03:43:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:16,126 INFO L225 Difference]: With dead ends: 121 [2023-02-16 03:43:16,126 INFO L226 Difference]: Without dead ends: 121 [2023-02-16 03:43:16,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 6 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=385, Invalid=3278, Unknown=1, NotChecked=118, Total=3782 [2023-02-16 03:43:16,127 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 337 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:16,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1026 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1695 Invalid, 0 Unknown, 125 Unchecked, 1.0s Time] [2023-02-16 03:43:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-16 03:43:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2023-02-16 03:43:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 97 states have internal predecessors, (103), 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) [2023-02-16 03:43:16,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2023-02-16 03:43:16,129 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 53 [2023-02-16 03:43:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:16,129 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2023-02-16 03:43:16,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:43:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2023-02-16 03:43:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-16 03:43:16,129 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:16,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:16,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:16,335 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,SelfDestructingSolverStorable24 [2023-02-16 03:43:16,336 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:16,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:16,336 INFO L85 PathProgramCache]: Analyzing trace with hash 512975502, now seen corresponding path program 1 times [2023-02-16 03:43:16,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:16,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394230490] [2023-02-16 03:43:16,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:16,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:16,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:17,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:17,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:17,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:18,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:18,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394230490] [2023-02-16 03:43:18,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394230490] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:18,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495252229] [2023-02-16 03:43:18,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:18,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:18,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:18,303 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) [2023-02-16 03:43:18,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 03:43:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:18,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 126 conjunts are in the unsatisfiable core [2023-02-16 03:43:18,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:18,625 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:18,628 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:18,935 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:18,935 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:18,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:43:19,087 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:19,094 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:19,189 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:19,195 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:19,322 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:19,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2023-02-16 03:43:19,333 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:19,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2023-02-16 03:43:19,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,435 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:19,600 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:43:19,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2023-02-16 03:43:19,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-02-16 03:43:19,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:19,769 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_4025 (Array Int Int)) (v_ArrVal_4026 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4026)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_4025)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (select |c_old(#valid)| |node_create_~temp~0#1.base|) 0) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2023-02-16 03:43:19,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:43:19,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:19,808 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:43:19,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2023-02-16 03:43:19,823 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:43:19,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-02-16 03:43:19,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2023-02-16 03:43:20,047 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-16 03:43:20,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2023-02-16 03:43:20,055 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:43:20,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:43:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:43:20,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:20,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495252229] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:20,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:43:20,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 47 [2023-02-16 03:43:20,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164577565] [2023-02-16 03:43:20,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:43:20,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-16 03:43:20,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:43:20,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-16 03:43:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2569, Unknown=1, NotChecked=102, Total=2862 [2023-02-16 03:43:20,406 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 48 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 41 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:43:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:43:22,279 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2023-02-16 03:43:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:43:22,279 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 41 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2023-02-16 03:43:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:43:22,280 INFO L225 Difference]: With dead ends: 101 [2023-02-16 03:43:22,280 INFO L226 Difference]: Without dead ends: 101 [2023-02-16 03:43:22,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1255 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=378, Invalid=3657, Unknown=1, NotChecked=124, Total=4160 [2023-02-16 03:43:22,281 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 343 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:43:22,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1114 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1951 Invalid, 0 Unknown, 105 Unchecked, 1.1s Time] [2023-02-16 03:43:22,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-16 03:43:22,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-02-16 03:43:22,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 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) [2023-02-16 03:43:22,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2023-02-16 03:43:22,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 53 [2023-02-16 03:43:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:43:22,283 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2023-02-16 03:43:22,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 41 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:43:22,283 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2023-02-16 03:43:22,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-16 03:43:22,284 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:43:22,284 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:43:22,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:43:22,484 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,SelfDestructingSolverStorable25 [2023-02-16 03:43:22,485 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:43:22,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:43:22,485 INFO L85 PathProgramCache]: Analyzing trace with hash 167962770, now seen corresponding path program 1 times [2023-02-16 03:43:22,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:43:22,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039966546] [2023-02-16 03:43:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:22,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:43:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:43:23,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:43:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:43:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,574 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:43:24,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:43:24,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039966546] [2023-02-16 03:43:24,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039966546] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:43:24,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979169183] [2023-02-16 03:43:24,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:43:24,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:43:24,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:43:24,578 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) [2023-02-16 03:43:24,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 03:43:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:43:24,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 118 conjunts are in the unsatisfiable core [2023-02-16 03:43:24,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:43:24,873 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:24,880 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:25,007 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:25,007 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:25,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:43:25,233 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:43:25,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 03:43:25,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:43:25,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:43:25,624 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:43:25,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-02-16 03:43:25,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:25,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-02-16 03:43:25,910 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:43:25,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2023-02-16 03:43:25,915 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-16 03:43:25,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:43:26,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:26,194 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-16 03:43:26,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 44 [2023-02-16 03:43:26,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:26,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:26,208 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:43:26,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 03:43:26,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:26,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:43:26,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:43:26,783 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:43:26,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 58 [2023-02-16 03:43:26,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2023-02-16 03:43:26,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:26,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-02-16 03:43:26,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:43:26,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-02-16 03:43:26,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-16 03:43:26,983 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:43:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:43:27,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:43:27,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4338 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4338) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2023-02-16 03:43:57,776 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2023-02-16 03:43:57,776 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:04,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979169183] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:04,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:44:04,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2023-02-16 03:44:04,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369941039] [2023-02-16 03:44:04,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:44:04,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-02-16 03:44:04,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:04,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-02-16 03:44:04,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4587, Unknown=139, NotChecked=138, Total=5112 [2023-02-16 03:44:04,492 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:44:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:07,655 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2023-02-16 03:44:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 03:44:07,659 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2023-02-16 03:44:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:07,660 INFO L225 Difference]: With dead ends: 183 [2023-02-16 03:44:07,660 INFO L226 Difference]: Without dead ends: 183 [2023-02-16 03:44:07,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 33 SyntacticMatches, 10 SemanticMatches, 90 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1829 ImplicationChecksByTransitivity, 41.6s TimeCoverageRelationStatistics Valid=669, Invalid=7386, Unknown=139, NotChecked=178, Total=8372 [2023-02-16 03:44:07,663 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 785 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 2530 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:07,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1360 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2530 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-16 03:44:07,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-16 03:44:07,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 104. [2023-02-16 03:44:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.308641975308642) internal successors, (106), 99 states have internal predecessors, (106), 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) [2023-02-16 03:44:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2023-02-16 03:44:07,668 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 57 [2023-02-16 03:44:07,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:07,668 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2023-02-16 03:44:07,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:44:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2023-02-16 03:44:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-16 03:44:07,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:07,673 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:07,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-16 03:44:07,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:07,881 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:44:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 167962771, now seen corresponding path program 1 times [2023-02-16 03:44:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:07,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475505039] [2023-02-16 03:44:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:09,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:09,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:09,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:44:10,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:10,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475505039] [2023-02-16 03:44:10,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475505039] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:10,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951662518] [2023-02-16 03:44:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:10,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:10,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:10,335 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) [2023-02-16 03:44:10,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-16 03:44:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:10,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 132 conjunts are in the unsatisfiable core [2023-02-16 03:44:10,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:10,640 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:10,649 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:10,788 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:10,788 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:10,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:10,910 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:11,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,057 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:11,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-16 03:44:11,195 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:11,307 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:11,307 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 40 [2023-02-16 03:44:11,527 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:11,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2023-02-16 03:44:11,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,618 INFO L350 Elim1Store]: Elim1 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 30 [2023-02-16 03:44:11,912 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:44:11,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 33 [2023-02-16 03:44:11,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:44:11,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:44:11,925 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:12,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,425 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:12,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,441 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:12,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 70 [2023-02-16 03:44:12,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:12,459 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:44:12,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 03:44:12,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:44:13,336 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:44:13,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 114 treesize of output 86 [2023-02-16 03:44:13,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2023-02-16 03:44:13,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2023-02-16 03:44:13,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:44:13,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-02-16 03:44:13,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-02-16 03:44:13,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:13,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:13,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-02-16 03:44:13,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:13,786 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:13,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:44:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:44:13,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:44:20,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951662518] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:20,601 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:44:20,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 65 [2023-02-16 03:44:20,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815988054] [2023-02-16 03:44:20,601 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:44:20,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-02-16 03:44:20,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:20,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-02-16 03:44:20,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=5833, Unknown=47, NotChecked=0, Total=6162 [2023-02-16 03:44:20,603 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 66 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 57 states have internal predecessors, (100), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:44:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:27,504 INFO L93 Difference]: Finished difference Result 183 states and 196 transitions. [2023-02-16 03:44:27,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-16 03:44:27,504 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 57 states have internal predecessors, (100), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2023-02-16 03:44:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:27,505 INFO L225 Difference]: With dead ends: 183 [2023-02-16 03:44:27,505 INFO L226 Difference]: Without dead ends: 183 [2023-02-16 03:44:27,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=769, Invalid=9486, Unknown=47, NotChecked=0, Total=10302 [2023-02-16 03:44:27,507 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1001 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 3336 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 3414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 3336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:27,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 1471 Invalid, 3414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 3336 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-02-16 03:44:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-16 03:44:27,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 106. [2023-02-16 03:44:27,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 101 states have internal predecessors, (108), 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) [2023-02-16 03:44:27,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2023-02-16 03:44:27,510 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 57 [2023-02-16 03:44:27,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:27,510 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2023-02-16 03:44:27,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.6129032258064515) internal successors, (100), 57 states have internal predecessors, (100), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:44:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2023-02-16 03:44:27,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-16 03:44:27,510 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:27,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:27,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-16 03:44:27,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-16 03:44:27,711 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:44:27,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:27,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560249, now seen corresponding path program 1 times [2023-02-16 03:44:27,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:27,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221139379] [2023-02-16 03:44:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:27,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:27,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:27,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:27,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-02-16 03:44:27,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:27,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221139379] [2023-02-16 03:44:27,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221139379] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:44:27,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:44:27,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:44:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041243327] [2023-02-16 03:44:27,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:44:27,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:44:27,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:44:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:44:27,941 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:44:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:28,248 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2023-02-16 03:44:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:44:28,248 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2023-02-16 03:44:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:28,249 INFO L225 Difference]: With dead ends: 167 [2023-02-16 03:44:28,249 INFO L226 Difference]: Without dead ends: 167 [2023-02-16 03:44:28,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:44:28,250 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 140 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:28,250 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 633 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:44:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-02-16 03:44:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2023-02-16 03:44:28,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 102 states have internal predecessors, (110), 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) [2023-02-16 03:44:28,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2023-02-16 03:44:28,252 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2023-02-16 03:44:28,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:28,253 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2023-02-16 03:44:28,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:44:28,253 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2023-02-16 03:44:28,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-16 03:44:28,253 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:28,253 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:28,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-16 03:44:28,253 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:44:28,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560248, now seen corresponding path program 1 times [2023-02-16 03:44:28,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:28,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251246951] [2023-02-16 03:44:28,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:28,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:28,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:28,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-16 03:44:28,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:28,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251246951] [2023-02-16 03:44:28,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251246951] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:44:28,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:44:28,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-16 03:44:28,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562110216] [2023-02-16 03:44:28,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:44:28,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:44:28,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:28,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:44:28,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:44:28,548 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:44:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:28,837 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2023-02-16 03:44:28,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:44:28,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2023-02-16 03:44:28,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:28,838 INFO L225 Difference]: With dead ends: 149 [2023-02-16 03:44:28,838 INFO L226 Difference]: Without dead ends: 149 [2023-02-16 03:44:28,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:44:28,838 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 187 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:28,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 670 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:44:28,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-16 03:44:28,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 103. [2023-02-16 03:44:28,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 80 states have (on average 1.3125) internal successors, (105), 98 states have internal predecessors, (105), 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) [2023-02-16 03:44:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2023-02-16 03:44:28,841 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 58 [2023-02-16 03:44:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:28,841 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2023-02-16 03:44:28,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-16 03:44:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2023-02-16 03:44:28,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 03:44:28,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:28,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:28,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-16 03:44:28,842 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:44:28,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:28,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1796531691, now seen corresponding path program 1 times [2023-02-16 03:44:28,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:28,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359429142] [2023-02-16 03:44:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:31,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:31,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:32,003 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:44:32,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:32,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359429142] [2023-02-16 03:44:32,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359429142] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:32,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661598501] [2023-02-16 03:44:32,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:32,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:32,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:32,005 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) [2023-02-16 03:44:32,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-16 03:44:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:32,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 159 conjunts are in the unsatisfiable core [2023-02-16 03:44:32,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:32,353 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:32,394 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:32,503 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:32,504 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:32,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:32,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:44:32,795 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:44:32,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 03:44:32,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:44:32,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:33,053 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:33,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 48 [2023-02-16 03:44:33,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:44:33,241 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:33,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2023-02-16 03:44:33,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:44:33,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:33,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-02-16 03:44:33,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:33,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:44:33,549 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:44:33,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2023-02-16 03:44:33,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:44:33,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:44:33,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:33,954 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:33,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:33,969 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:33,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 58 [2023-02-16 03:44:33,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:33,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:33,985 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:44:33,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 03:44:33,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:44:34,630 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:34,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 91 [2023-02-16 03:44:34,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-02-16 03:44:34,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-02-16 03:44:34,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2023-02-16 03:44:34,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:34,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:44:34,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:34,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-02-16 03:44:34,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:44:34,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:34,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-02-16 03:44:34,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:44:34,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:34,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:34,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-02-16 03:44:34,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:44:34,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:44:34,971 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 15 [2023-02-16 03:44:34,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:44:35,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:44:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:44:35,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:44:35,383 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5310 (Array Int Int)) (v_ArrVal_5312 (Array Int Int)) (v_ArrVal_5311 (Array Int Int)) (v_ArrVal_5313 (Array Int Int)) (v_ArrVal_5309 (Array Int Int)) (v_ArrVal_5308 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5310) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5312) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5308) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5311) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5309) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5313) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:44:40,857 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| Int) (v_ArrVal_5301 Int) (v_ArrVal_5310 (Array Int Int)) (v_ArrVal_5312 (Array Int Int)) (v_ArrVal_5311 (Array Int Int)) (v_ArrVal_5303 (Array Int Int)) (v_ArrVal_5313 (Array Int Int)) (v_ArrVal_5327 (Array Int Int)) (v_ArrVal_5326 (Array Int Int)) (v_ArrVal_5304 (Array Int Int)) (v_ArrVal_5328 (Array Int Int)) (v_ArrVal_5309 (Array Int Int)) (v_ArrVal_5308 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_5327))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27|))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| |c_#StackHeapBarrier|)) (= (let ((.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_5328))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_5326))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_5301))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_5310) .cse3 v_ArrVal_5312) (select (select (store (store (store .cse4 .cse1 v_ArrVal_5303) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_5308) .cse3 v_ArrVal_5311) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse5 .cse1 v_ArrVal_5304) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_27| v_ArrVal_5309) .cse3 v_ArrVal_5313) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) |c_ULTIMATE.start_main_~data~0#1|) (not (<= 0 .cse2)))))) is different from false [2023-02-16 03:44:40,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661598501] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:40,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:44:40,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 72 [2023-02-16 03:44:40,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843981977] [2023-02-16 03:44:40,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:44:40,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-16 03:44:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-16 03:44:40,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=6320, Unknown=45, NotChecked=322, Total=6972 [2023-02-16 03:44:40,862 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:44:48,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:48,815 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2023-02-16 03:44:48,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-16 03:44:48,815 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2023-02-16 03:44:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:48,816 INFO L225 Difference]: With dead ends: 184 [2023-02-16 03:44:48,816 INFO L226 Difference]: Without dead ends: 184 [2023-02-16 03:44:48,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2267 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=828, Invalid=10905, Unknown=47, NotChecked=430, Total=12210 [2023-02-16 03:44:48,818 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 976 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 88 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:48,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 1721 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 3256 Invalid, 2 Unknown, 0 Unchecked, 2.0s Time] [2023-02-16 03:44:48,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-16 03:44:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 108. [2023-02-16 03:44:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 103 states have internal predecessors, (110), 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) [2023-02-16 03:44:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2023-02-16 03:44:48,820 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 59 [2023-02-16 03:44:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:48,820 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2023-02-16 03:44:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:44:48,821 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2023-02-16 03:44:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-16 03:44:48,821 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:48,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:48,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-16 03:44:49,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:49,022 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:44:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:49,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1360500636, now seen corresponding path program 1 times [2023-02-16 03:44:49,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:49,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004206672] [2023-02-16 03:44:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:49,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:49,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:49,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:44:49,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:49,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004206672] [2023-02-16 03:44:49,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004206672] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:49,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561763805] [2023-02-16 03:44:49,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:49,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:49,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:49,159 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) [2023-02-16 03:44:49,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-16 03:44:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:49,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-16 03:44:49,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:49,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:44:49,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:44:49,510 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:44:49,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:44:49,567 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:44:49,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561763805] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:44:49,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:44:49,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2023-02-16 03:44:49,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249382478] [2023-02-16 03:44:49,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:44:49,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:44:49,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:49,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:44:49,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:44:49,569 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:44:49,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:49,751 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2023-02-16 03:44:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:44:49,752 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 59 [2023-02-16 03:44:49,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:49,752 INFO L225 Difference]: With dead ends: 92 [2023-02-16 03:44:49,752 INFO L226 Difference]: Without dead ends: 92 [2023-02-16 03:44:49,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-16 03:44:49,753 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 8 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:49,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 612 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:44:49,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-02-16 03:44:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-02-16 03:44:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 73 states have (on average 1.273972602739726) internal successors, (93), 87 states have internal predecessors, (93), 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) [2023-02-16 03:44:49,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2023-02-16 03:44:49,755 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 59 [2023-02-16 03:44:49,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:49,755 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2023-02-16 03:44:49,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 10 states have internal predecessors, (47), 1 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-16 03:44:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2023-02-16 03:44:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-16 03:44:49,756 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:49,756 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:49,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:44:49,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:49,957 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:44:49,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:49,957 INFO L85 PathProgramCache]: Analyzing trace with hash -18866038, now seen corresponding path program 1 times [2023-02-16 03:44:49,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:49,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868767845] [2023-02-16 03:44:49,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:49,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:50,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:50,427 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:44:50,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:50,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868767845] [2023-02-16 03:44:50,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868767845] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:50,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621899410] [2023-02-16 03:44:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:50,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:50,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:50,438 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) [2023-02-16 03:44:50,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-16 03:44:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:50,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:44:50,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:50,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:44:50,811 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5854 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5854))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:44:50,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:44:50,856 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5855 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5855))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:44:50,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:44:50,913 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5856 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5856))) (not (= 0 |node_create_~temp~0#1.base|)))) is different from true [2023-02-16 03:44:50,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:44:50,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:44:50,961 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:44:50,961 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:50,978 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2023-02-16 03:44:50,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:44:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-02-16 03:44:51,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621899410] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:44:51,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:44:51,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8, 7] total 30 [2023-02-16 03:44:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002875546] [2023-02-16 03:44:51,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:44:51,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:44:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:44:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:44:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=623, Unknown=3, NotChecked=156, Total=870 [2023-02-16 03:44:51,396 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 30 states, 29 states have (on average 4.241379310344827) internal successors, (123), 27 states have internal predecessors, (123), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-16 03:44:52,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:44:52,254 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-02-16 03:44:52,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-16 03:44:52,255 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 4.241379310344827) internal successors, (123), 27 states have internal predecessors, (123), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 60 [2023-02-16 03:44:52,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:44:52,256 INFO L225 Difference]: With dead ends: 82 [2023-02-16 03:44:52,256 INFO L226 Difference]: Without dead ends: 82 [2023-02-16 03:44:52,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 104 SyntacticMatches, 9 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=341, Invalid=1560, Unknown=3, NotChecked=258, Total=2162 [2023-02-16 03:44:52,257 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 545 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:44:52,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 430 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 618 Invalid, 0 Unknown, 231 Unchecked, 0.4s Time] [2023-02-16 03:44:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-02-16 03:44:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-02-16 03:44:52,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 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) [2023-02-16 03:44:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-02-16 03:44:52,259 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 60 [2023-02-16 03:44:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:44:52,259 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-02-16 03:44:52,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 4.241379310344827) internal successors, (123), 27 states have internal predecessors, (123), 4 states have call successors, (9), 3 states have call predecessors, (9), 7 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-16 03:44:52,260 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-02-16 03:44:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-16 03:44:52,260 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:44:52,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:44:52,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-02-16 03:44:52,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:52,471 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:44:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:44:52,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535007, now seen corresponding path program 1 times [2023-02-16 03:44:52,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:44:52,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13470341] [2023-02-16 03:44:52,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:52,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:44:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:54,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:44:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:54,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:44:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:54,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:44:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:54,776 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:44:54,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:44:54,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13470341] [2023-02-16 03:44:54,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13470341] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:44:54,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825179801] [2023-02-16 03:44:54,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:44:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:44:54,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:44:54,778 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) [2023-02-16 03:44:54,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-16 03:44:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:44:55,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-16 03:44:55,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:44:55,133 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:55,137 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:55,243 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:55,243 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:44:55,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:55,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:55,464 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:44:55,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-02-16 03:44:55,586 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:44:55,664 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:55,664 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 40 [2023-02-16 03:44:55,805 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:55,805 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 35 [2023-02-16 03:44:55,867 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-16 03:44:55,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 36 [2023-02-16 03:44:56,141 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:44:56,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 57 [2023-02-16 03:44:56,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2023-02-16 03:44:56,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:56,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:44:56,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 80 [2023-02-16 03:44:56,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:56,568 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:56,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 90 [2023-02-16 03:44:56,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:56,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:56,615 INFO L321 Elim1Store]: treesize reduction 138, result has 35.5 percent of original size [2023-02-16 03:44:56,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 103 treesize of output 160 [2023-02-16 03:44:56,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:56,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 72 [2023-02-16 03:44:58,056 INFO L321 Elim1Store]: treesize reduction 96, result has 10.3 percent of original size [2023-02-16 03:44:58,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 168 treesize of output 101 [2023-02-16 03:44:58,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:58,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2023-02-16 03:44:58,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:58,186 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:58,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 56 [2023-02-16 03:44:58,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:44:58,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-02-16 03:44:58,289 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:44:58,289 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 106 [2023-02-16 03:44:58,297 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:44:58,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 96 [2023-02-16 03:44:58,406 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:44:58,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 85 [2023-02-16 03:44:58,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 83 [2023-02-16 03:44:58,562 INFO L350 Elim1Store]: Elim1 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 92 treesize of output 64 [2023-02-16 03:44:58,855 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:44:58,856 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:44:58,856 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 39 [2023-02-16 03:44:59,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:44:59,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:44:59,318 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6168 (Array Int Int)) (v_ArrVal_6167 (Array Int Int)) (v_ArrVal_6169 (Array Int Int)) (v_ArrVal_6170 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6167) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6170))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6168) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2023-02-16 03:45:00,171 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6168 (Array Int Int)) (v_ArrVal_6167 (Array Int Int)) (v_ArrVal_6169 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| Int) (v_ArrVal_6180 (Array Int Int)) (v_ArrVal_6181 (Array Int Int)) (v_ArrVal_6170 (Array Int Int)) (v_ArrVal_6163 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_6180))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_6181))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse1 .cse2))) (let ((.cse5 (select .cse3 .cse4))) (select (let ((.cse0 (store (store (store .cse1 .cse2 (store .cse3 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_6167) .cse5 v_ArrVal_6170))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse6 .cse2 v_ArrVal_6163) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_6168) .cse5 v_ArrVal_6169) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) 1) (not (<= 0 .cse4)))))) is different from false [2023-02-16 03:45:00,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825179801] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:00,173 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:45:00,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 71 [2023-02-16 03:45:00,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064084711] [2023-02-16 03:45:00,173 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:45:00,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2023-02-16 03:45:00,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:45:00,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2023-02-16 03:45:00,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=6014, Unknown=49, NotChecked=314, Total=6642 [2023-02-16 03:45:00,174 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:45:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:45:07,535 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2023-02-16 03:45:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-16 03:45:07,535 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2023-02-16 03:45:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:45:07,536 INFO L225 Difference]: With dead ends: 139 [2023-02-16 03:45:07,536 INFO L226 Difference]: Without dead ends: 139 [2023-02-16 03:45:07,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1946 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=712, Invalid=8947, Unknown=51, NotChecked=390, Total=10100 [2023-02-16 03:45:07,537 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1322 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 2799 mSolverCounterSat, 68 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1322 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 2799 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:45:07,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1322 Valid, 1140 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 2799 Invalid, 2 Unknown, 0 Unchecked, 2.1s Time] [2023-02-16 03:45:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-16 03:45:07,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2023-02-16 03:45:07,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 81 states have internal predecessors, (87), 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) [2023-02-16 03:45:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2023-02-16 03:45:07,539 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 63 [2023-02-16 03:45:07,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:45:07,539 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2023-02-16 03:45:07,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:45:07,539 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2023-02-16 03:45:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-16 03:45:07,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:45:07,539 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:45:07,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:45:07,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:45:07,748 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:45:07,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:45:07,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535006, now seen corresponding path program 1 times [2023-02-16 03:45:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:45:07,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521979407] [2023-02-16 03:45:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:45:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:10,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:45:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:10,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:45:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:45:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:10,983 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:45:10,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:45:10,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521979407] [2023-02-16 03:45:10,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521979407] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:10,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242642226] [2023-02-16 03:45:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:10,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:45:10,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:45:10,985 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) [2023-02-16 03:45:10,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-16 03:45:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:11,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 150 conjunts are in the unsatisfiable core [2023-02-16 03:45:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:45:11,389 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:11,398 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:11,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:11,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:45:11,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:11,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:11,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:11,756 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:45:11,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 03:45:11,893 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:12,001 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:45:12,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-02-16 03:45:12,217 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:45:12,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-02-16 03:45:12,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:12,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-02-16 03:45:12,535 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:45:12,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-02-16 03:45:12,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:12,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:45:12,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:45:12,636 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:13,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,022 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:13,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 50 [2023-02-16 03:45:13,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,034 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:45:13,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 03:45:13,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:45:13,739 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-02-16 03:45:13,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 111 treesize of output 67 [2023-02-16 03:45:13,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2023-02-16 03:45:13,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,849 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:13,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-02-16 03:45:13,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:45:13,879 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:45:13,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 77 [2023-02-16 03:45:13,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-02-16 03:45:13,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,985 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:13,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 64 [2023-02-16 03:45:13,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:13,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:45:14,270 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-16 03:45:14,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 46 [2023-02-16 03:45:14,512 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:45:14,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:45:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:45:14,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:45:14,993 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6486 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6486))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6487 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6487))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_6486 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6486))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (forall ((v_ArrVal_6487 (Array Int Int))) (<= 0 (+ (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6487) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse4) 8)))))))) is different from false [2023-02-16 03:45:15,429 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)))) (and (forall ((v_ArrVal_6485 (Array Int Int)) (v_ArrVal_6484 (Array Int Int)) (v_ArrVal_6486 (Array Int Int))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6485) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6486))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6487 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6484) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6487) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse2) 8))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_6485 (Array Int Int)) (v_ArrVal_6484 (Array Int Int)) (v_ArrVal_6486 (Array Int Int))) (let ((.cse4 (store (store .cse3 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6485) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6486))) (let ((.cse6 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6487 (Array Int Int))) (let ((.cse7 (store (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6484) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6487))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse4 .cse5) .cse6) 12) (select |c_#length| (select (select .cse7 .cse5) .cse6)))))) (not (<= 0 .cse6)))))))) is different from false [2023-02-16 03:45:19,160 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse5 (select .cse9 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (and (forall ((v_ArrVal_6485 (Array Int Int)) (v_ArrVal_6484 (Array Int Int)) (v_ArrVal_6486 (Array Int Int))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6485) .cse5 v_ArrVal_6486))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6487 (Array Int Int))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6484) .cse5 v_ArrVal_6487))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse0) 12) (select |c_#length| (select (select .cse3 .cse2) .cse0)))))))))) (forall ((v_ArrVal_6485 (Array Int Int)) (v_ArrVal_6484 (Array Int Int)) (v_ArrVal_6486 (Array Int Int))) (let ((.cse7 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6485) .cse5 v_ArrVal_6486))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6487 (Array Int Int))) (<= 0 (+ (select (select .cse7 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6484) .cse5 v_ArrVal_6487) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8) 8))) (not (<= 0 .cse8))))))))) is different from false [2023-02-16 03:45:19,206 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse9 (select |c_#memory_$Pointer$.base| .cse11)) (.cse10 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse11 (store .cse9 .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse5 (select .cse9 .cse10))) (and (forall ((v_ArrVal_6485 (Array Int Int)) (v_ArrVal_6484 (Array Int Int)) (v_ArrVal_6486 (Array Int Int))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6485) .cse5 v_ArrVal_6486))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6487 (Array Int Int))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6484) .cse5 v_ArrVal_6487))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_6485 (Array Int Int)) (v_ArrVal_6484 (Array Int Int)) (v_ArrVal_6486 (Array Int Int))) (let ((.cse8 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6485) .cse5 v_ArrVal_6486))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse7)) (forall ((v_ArrVal_6487 (Array Int Int))) (<= 0 (+ (select (select .cse8 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6484) .cse5 v_ArrVal_6487) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse7) 8))))))))))) is different from false [2023-02-16 03:45:19,808 INFO L350 Elim1Store]: Elim1 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 1357 treesize of output 1157 [2023-02-16 03:45:21,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242642226] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:21,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:45:21,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 36] total 72 [2023-02-16 03:45:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033366904] [2023-02-16 03:45:21,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:45:21,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-02-16 03:45:21,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:45:21,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-02-16 03:45:21,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=6674, Unknown=54, NotChecked=668, Total=7656 [2023-02-16 03:45:21,210 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 73 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 64 states have internal predecessors, (110), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:45:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:45:30,440 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2023-02-16 03:45:30,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-16 03:45:30,440 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 64 states have internal predecessors, (110), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2023-02-16 03:45:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:45:30,441 INFO L225 Difference]: With dead ends: 155 [2023-02-16 03:45:30,441 INFO L226 Difference]: Without dead ends: 155 [2023-02-16 03:45:30,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 112 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=704, Invalid=11248, Unknown=54, NotChecked=876, Total=12882 [2023-02-16 03:45:30,442 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1160 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 3152 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1160 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:45:30,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1160 Valid, 1217 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3152 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-02-16 03:45:30,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-16 03:45:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 88. [2023-02-16 03:45:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 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) [2023-02-16 03:45:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2023-02-16 03:45:30,445 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 63 [2023-02-16 03:45:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:45:30,446 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2023-02-16 03:45:30,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 69 states have (on average 1.5942028985507246) internal successors, (110), 64 states have internal predecessors, (110), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:45:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2023-02-16 03:45:30,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-16 03:45:30,446 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:45:30,446 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:45:30,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-16 03:45:30,654 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,SelfDestructingSolverStorable34 [2023-02-16 03:45:30,654 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:45:30,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:45:30,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1257988692, now seen corresponding path program 1 times [2023-02-16 03:45:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:45:30,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822800240] [2023-02-16 03:45:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:45:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:32,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:45:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:32,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:45:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:32,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:45:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:45:33,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:45:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822800240] [2023-02-16 03:45:33,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822800240] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:33,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022488163] [2023-02-16 03:45:33,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:33,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:45:33,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:45:33,269 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) [2023-02-16 03:45:33,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-02-16 03:45:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:33,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 133 conjunts are in the unsatisfiable core [2023-02-16 03:45:33,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:45:33,674 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:33,701 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:33,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:33,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:45:34,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:34,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:34,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:34,280 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:45:34,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 03:45:34,500 INFO L350 Elim1Store]: Elim1 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:34,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:45:34,835 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:45:34,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-02-16 03:45:34,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:34,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-02-16 03:45:35,146 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:45:35,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2023-02-16 03:45:35,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-16 03:45:35,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:35,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:45:35,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:35,547 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-02-16 03:45:35,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 45 [2023-02-16 03:45:35,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:35,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:35,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:35,570 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:45:35,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 03:45:35,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:35,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:45:36,374 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-02-16 03:45:36,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 58 [2023-02-16 03:45:36,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:36,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:45:36,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:36,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:45:36,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:36,508 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:36,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 38 [2023-02-16 03:45:36,542 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:45:36,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 61 [2023-02-16 03:45:36,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:36,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:45:36,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:36,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:45:36,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:36,666 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:36,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 48 [2023-02-16 03:45:36,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:45:37,096 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:45:37,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2023-02-16 03:45:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:45:37,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:45:37,143 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-16 03:45:37,149 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6801 (Array Int Int)) (v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6802 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6801) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6802) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-16 03:45:37,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array Int Int)) (v_ArrVal_6801 (Array Int Int)) (v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6802 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (not (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6801) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6797) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6802) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2023-02-16 03:45:37,454 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array Int Int)) (v_ArrVal_6801 (Array Int Int)) (v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6802 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6801) .cse2 v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6797) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6802) .cse2 v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))) is different from false [2023-02-16 03:45:37,778 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array Int Int)) (v_ArrVal_6801 (Array Int Int)) (v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6802 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6801) .cse2 v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_6797) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6802) .cse2 v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2023-02-16 03:45:37,801 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array Int Int)) (v_ArrVal_6801 (Array Int Int)) (v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6802 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6801) .cse3 v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6797) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6802) .cse3 v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2023-02-16 03:45:37,810 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array Int Int)) (v_ArrVal_6801 (Array Int Int)) (v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6802 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select |c_#memory_$Pointer$.base| .cse2)) (.cse5 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse4 .cse5))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6801) .cse3 v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6797) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6802) .cse3 v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2023-02-16 03:45:37,908 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| Int) (v_ArrVal_6801 (Array Int Int)) (v_ArrVal_6814 (Array Int Int)) (v_ArrVal_6803 (Array Int Int)) (v_ArrVal_6813 (Array Int Int)) (v_ArrVal_6802 (Array Int Int)) (v_ArrVal_6804 (Array Int Int))) (or (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6814))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6813)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (select .cse5 .cse3)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse6 .cse7))) (let ((.cse0 (store (store (store .cse5 .cse3 (store .cse6 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6801) .cse4 v_ArrVal_6804))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store .cse2 .cse3 v_ArrVal_6797) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6802) .cse4 v_ArrVal_6803) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| |c_#StackHeapBarrier|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40|))))) is different from false [2023-02-16 03:45:37,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022488163] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:37,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:45:37,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 70 [2023-02-16 03:45:37,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76779401] [2023-02-16 03:45:37,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:45:37,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2023-02-16 03:45:37,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:45:37,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2023-02-16 03:45:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=4799, Unknown=81, NotChecked=1176, Total=6320 [2023-02-16 03:45:37,912 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:45:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:45:43,651 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2023-02-16 03:45:43,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 03:45:43,656 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2023-02-16 03:45:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:45:43,657 INFO L225 Difference]: With dead ends: 109 [2023-02-16 03:45:43,657 INFO L226 Difference]: Without dead ends: 109 [2023-02-16 03:45:43,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=687, Invalid=7818, Unknown=83, NotChecked=1512, Total=10100 [2023-02-16 03:45:43,657 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 876 mSDsluCounter, 1248 mSDsCounter, 0 mSdLazyCounter, 2502 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 2502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:45:43,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1282 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 2502 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-16 03:45:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-16 03:45:43,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2023-02-16 03:45:43,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 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) [2023-02-16 03:45:43,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-16 03:45:43,659 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 64 [2023-02-16 03:45:43,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:45:43,659 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-16 03:45:43,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-16 03:45:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-16 03:45:43,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-16 03:45:43,660 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:45:43,660 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:45:43,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-02-16 03:45:43,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-02-16 03:45:43,867 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:45:43,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:45:43,868 INFO L85 PathProgramCache]: Analyzing trace with hash 342976484, now seen corresponding path program 1 times [2023-02-16 03:45:43,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:45:43,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339791250] [2023-02-16 03:45:43,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:43,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:45:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 03:45:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-02-16 03:45:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:47,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-02-16 03:45:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:48,560 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:45:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:45:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339791250] [2023-02-16 03:45:48,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339791250] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:45:48,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892148987] [2023-02-16 03:45:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:45:48,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:45:48,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:45:48,561 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:45:48,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-02-16 03:45:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:45:48,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 175 conjunts are in the unsatisfiable core [2023-02-16 03:45:48,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:45:48,992 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:49,055 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:49,242 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:45:49,243 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:49,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:49,584 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:45:49,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-02-16 03:45:49,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:45:49,939 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:45:49,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 40 [2023-02-16 03:45:50,193 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:45:50,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 42 [2023-02-16 03:45:50,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:50,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2023-02-16 03:45:50,671 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:45:50,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 26 [2023-02-16 03:45:50,676 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-02-16 03:45:50,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-02-16 03:45:51,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:45:51,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:51,320 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:45:51,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:51,344 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:51,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 49 [2023-02-16 03:45:51,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:51,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:51,366 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-02-16 03:45:51,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-02-16 03:45:52,367 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2023-02-16 03:45:52,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 120 treesize of output 72 [2023-02-16 03:45:52,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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 [2023-02-16 03:45:52,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2023-02-16 03:45:52,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:45:52,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,568 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:52,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-02-16 03:45:52,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:45:52,822 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:45:52,823 INFO L350 Elim1Store]: Elim1 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 94 [2023-02-16 03:45:52,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2023-02-16 03:45:52,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2023-02-16 03:45:52,975 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:45:52,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 66 [2023-02-16 03:45:52,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:45:52,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:45:52,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-16 03:45:53,420 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2023-02-16 03:45:53,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 48 [2023-02-16 03:45:53,708 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:45:53,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-16 03:45:53,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:45:53,872 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-16 03:45:53,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:45:54,236 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int))) (= (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7126)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7127))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7125) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,245 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int))) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7126)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7127))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7125) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,254 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7126)) (.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7127))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121)) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7125) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,266 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7114 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7126)) (.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7127))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_7114))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121))) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7125) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,292 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7114 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_7126)) (.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_7127))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_7114))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121))) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_7125) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 8)))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,306 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7114 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) .cse1 v_ArrVal_7126)) (.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) .cse1 v_ArrVal_7127))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_7114))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121))) .cse1 v_ArrVal_7125) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,323 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7114 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) .cse1 v_ArrVal_7126)) (.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) .cse1 v_ArrVal_7127))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_7114))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121))) .cse1 v_ArrVal_7125) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,337 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7114 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse6 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (let ((.cse5 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) .cse1 v_ArrVal_7126)) (.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) .cse1 v_ArrVal_7127))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_7114))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121))) .cse1 v_ArrVal_7125) (select (select .cse2 .cse3) .cse4)) (+ (select (select .cse5 .cse3) .cse4) 8)))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7114 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7123) .cse2 v_ArrVal_7126)) (.cse3 (store (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse7 .cse8 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_7122) .cse2 v_ArrVal_7127))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_7114))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset| v_ArrVal_7121))) .cse2 v_ArrVal_7125) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 8))))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,367 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7123 (Array Int Int)) (v_ArrVal_7121 Int) (v_ArrVal_7122 (Array Int Int)) (v_ArrVal_7114 (Array Int Int)) (v_ArrVal_7125 (Array Int Int)) (v_ArrVal_7127 (Array Int Int)) (v_ArrVal_7126 (Array Int Int)) (v_ArrVal_7119 Int)) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse7 (select |c_#memory_$Pointer$.base| .cse1)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select .cse7 .cse8))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_7123) .cse2 v_ArrVal_7126)) (.cse3 (store (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse7 .cse8 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_7122) .cse2 v_ArrVal_7127))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (let ((.cse0 (store |c_#memory_int| .cse1 v_ArrVal_7114))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| (store (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| 4) v_ArrVal_7119) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.offset| v_ArrVal_7121))) .cse2 v_ArrVal_7125) (select (select .cse3 .cse4) .cse5)) (+ (select (select .cse6 .cse4) .cse5) 8))))))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2023-02-16 03:45:54,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:45:54,478 INFO L350 Elim1Store]: Elim1 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 476 treesize of output 469 [2023-02-16 03:45:54,495 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:45:54,495 INFO L350 Elim1Store]: Elim1 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 25646 treesize of output 24834 [2023-02-16 03:45:54,517 INFO L350 Elim1Store]: Elim1 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 24622 treesize of output 20582 [2023-02-16 03:45:54,543 INFO L350 Elim1Store]: Elim1 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 23048 treesize of output 21634