./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-2329fc7 [2023-02-14 02:20:24,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 02:20:24,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 02:20:24,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 02:20:24,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 02:20:24,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 02:20:24,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 02:20:24,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 02:20:24,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 02:20:24,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 02:20:24,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 02:20:24,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 02:20:24,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 02:20:24,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 02:20:24,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 02:20:24,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 02:20:24,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 02:20:24,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 02:20:24,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 02:20:24,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 02:20:24,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 02:20:24,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 02:20:24,317 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 02:20:24,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 02:20:24,324 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 02:20:24,324 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 02:20:24,324 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 02:20:24,325 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 02:20:24,326 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 02:20:24,326 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 02:20:24,326 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 02:20:24,327 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 02:20:24,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 02:20:24,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 02:20:24,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 02:20:24,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 02:20:24,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 02:20:24,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 02:20:24,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 02:20:24,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 02:20:24,333 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 02:20:24,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 02:20:24,356 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 02:20:24,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 02:20:24,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 02:20:24,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 02:20:24,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 02:20:24,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 02:20:24,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 02:20:24,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 02:20:24,359 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 02:20:24,359 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 02:20:24,360 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 02:20:24,360 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 02:20:24,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 02:20:24,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 02:20:24,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 02:20:24,361 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 02:20:24,361 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 02:20:24,361 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 02:20:24,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 02:20:24,361 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 02:20:24,361 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 02:20:24,362 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 02:20:24,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 02:20:24,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 02:20:24,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 02:20:24,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:20:24,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 02:20:24,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 02:20:24,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 02:20:24,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 02:20:24,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 02:20:24,363 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 02:20:24,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 02:20:24,364 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 02:20:24,364 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 -> 8eaca07dd267d84d5b5f55ad6096951e873362e33b975be77e0f552bdb4e3bcb [2023-02-14 02:20:24,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 02:20:24,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 02:20:24,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 02:20:24,578 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 02:20:24,578 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 02:20:24,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-02-14 02:20:25,568 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 02:20:25,727 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 02:20:25,727 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_equal.i [2023-02-14 02:20:25,736 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3d311c4/04a824d3fe56415bbc9ac89ef0ff8a69/FLAGdb33693e5 [2023-02-14 02:20:25,745 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3d311c4/04a824d3fe56415bbc9ac89ef0ff8a69 [2023-02-14 02:20:25,747 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 02:20:25,748 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 02:20:25,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 02:20:25,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 02:20:25,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 02:20:25,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:20:25" (1/1) ... [2023-02-14 02:20:25,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21cce800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:25, skipping insertion in model container [2023-02-14 02:20:25,753 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 02:20:25" (1/1) ... [2023-02-14 02:20:25,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 02:20:25,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 02:20:25,994 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/sll2c_insert_equal.i[24601,24614] [2023-02-14 02:20:25,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:20:26,007 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 02:20:26,051 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/sll2c_insert_equal.i[24601,24614] [2023-02-14 02:20:26,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 02:20:26,093 INFO L208 MainTranslator]: Completed translation [2023-02-14 02:20:26,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26 WrapperNode [2023-02-14 02:20:26,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 02:20:26,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 02:20:26,095 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 02:20:26,095 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 02:20:26,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,146 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 147 [2023-02-14 02:20:26,146 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 02:20:26,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 02:20:26,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 02:20:26,147 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 02:20:26,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,188 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,192 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,194 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 02:20:26,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 02:20:26,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 02:20:26,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 02:20:26,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (1/1) ... [2023-02-14 02:20:26,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 02:20:26,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:26,220 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-14 02:20:26,237 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-14 02:20:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-14 02:20:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-14 02:20:26,244 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-14 02:20:26,245 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-14 02:20:26,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 02:20:26,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 02:20:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 02:20:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 02:20:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 02:20:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 02:20:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 02:20:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-14 02:20:26,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 02:20:26,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 02:20:26,330 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 02:20:26,332 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 02:20:26,726 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 02:20:26,735 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 02:20:26,735 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-14 02:20:26,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:20:26 BoogieIcfgContainer [2023-02-14 02:20:26,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 02:20:26,738 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 02:20:26,738 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 02:20:26,741 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 02:20:26,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 02:20:25" (1/3) ... [2023-02-14 02:20:26,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68863436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:20:26, skipping insertion in model container [2023-02-14 02:20:26,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 02:20:26" (2/3) ... [2023-02-14 02:20:26,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68863436 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 02:20:26, skipping insertion in model container [2023-02-14 02:20:26,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 02:20:26" (3/3) ... [2023-02-14 02:20:26,743 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_equal.i [2023-02-14 02:20:26,755 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 02:20:26,756 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-02-14 02:20:26,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 02:20:26,800 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;@1cc1af04, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 02:20:26,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-02-14 02:20:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 02:20:26,809 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:26,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 02:20:26,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:26,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:26,815 INFO L85 PathProgramCache]: Analyzing trace with hash 895367701, now seen corresponding path program 1 times [2023-02-14 02:20:26,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:26,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805241162] [2023-02-14 02:20:26,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:26,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,011 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-14 02:20:27,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:27,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805241162] [2023-02-14 02:20:27,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805241162] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:27,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:27,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:20:27,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103942127] [2023-02-14 02:20:27,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:27,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:20:27,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:27,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:20:27,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:20:27,045 INFO L87 Difference]: Start difference. First operand has 121 states, 64 states have (on average 2.03125) internal successors, (130), 116 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:20:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:27,123 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2023-02-14 02:20:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:20:27,126 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-14 02:20:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:27,131 INFO L225 Difference]: With dead ends: 119 [2023-02-14 02:20:27,131 INFO L226 Difference]: Without dead ends: 116 [2023-02-14 02:20:27,133 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-14 02:20:27,136 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 8 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:27,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 189 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-14 02:20:27,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-02-14 02:20:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 62 states have (on average 1.9193548387096775) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2023-02-14 02:20:27,163 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 6 [2023-02-14 02:20:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:27,163 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2023-02-14 02:20:27,163 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-14 02:20:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2023-02-14 02:20:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-14 02:20:27,164 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:27,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-14 02:20:27,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-14 02:20:27,164 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:27,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:27,165 INFO L85 PathProgramCache]: Analyzing trace with hash 895367702, now seen corresponding path program 1 times [2023-02-14 02:20:27,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:27,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164171955] [2023-02-14 02:20:27,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:27,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,230 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-14 02:20:27,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:27,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164171955] [2023-02-14 02:20:27,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164171955] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:27,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:27,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 02:20:27,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253903174] [2023-02-14 02:20:27,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:27,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 02:20:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:27,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 02:20:27,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 02:20:27,233 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 02:20:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:27,291 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2023-02-14 02:20:27,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 02:20:27,291 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-14 02:20:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:27,292 INFO L225 Difference]: With dead ends: 114 [2023-02-14 02:20:27,292 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 02:20:27,293 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-14 02:20:27,293 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:27,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 191 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:20:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 02:20:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-02-14 02:20:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 62 states have (on average 1.8870967741935485) internal successors, (117), 109 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:27,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2023-02-14 02:20:27,300 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 6 [2023-02-14 02:20:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:27,301 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2023-02-14 02:20:27,301 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-14 02:20:27,301 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2023-02-14 02:20:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 02:20:27,301 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:27,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:27,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-14 02:20:27,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:27,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1575141079, now seen corresponding path program 1 times [2023-02-14 02:20:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:27,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934838448] [2023-02-14 02:20:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:27,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,374 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-14 02:20:27,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:27,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934838448] [2023-02-14 02:20:27,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934838448] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:27,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:27,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:20:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651261217] [2023-02-14 02:20:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:27,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:20:27,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:27,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:20:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:20:27,381 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 02:20:27,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:27,455 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2023-02-14 02:20:27,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:20:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-14 02:20:27,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:27,456 INFO L225 Difference]: With dead ends: 121 [2023-02-14 02:20:27,456 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 02:20:27,457 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-14 02:20:27,457 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 5 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:27,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 284 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:27,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 02:20:27,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2023-02-14 02:20:27,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 63 states have (on average 1.873015873015873) internal successors, (118), 110 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2023-02-14 02:20:27,465 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 13 [2023-02-14 02:20:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:27,465 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2023-02-14 02:20:27,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-14 02:20:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2023-02-14 02:20:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:20:27,466 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:27,466 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:27,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-14 02:20:27,466 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:27,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086820, now seen corresponding path program 1 times [2023-02-14 02:20:27,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:27,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539549655] [2023-02-14 02:20:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:27,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:20:27,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:27,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539549655] [2023-02-14 02:20:27,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539549655] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:27,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:27,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:20:27,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421972305] [2023-02-14 02:20:27,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:27,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:20:27,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:27,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:20:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:20:27,617 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 02:20:27,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:27,785 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2023-02-14 02:20:27,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:20:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 02:20:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:27,790 INFO L225 Difference]: With dead ends: 115 [2023-02-14 02:20:27,790 INFO L226 Difference]: Without dead ends: 115 [2023-02-14 02:20:27,790 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-14 02:20:27,796 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 13 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:27,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 405 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-14 02:20:27,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2023-02-14 02:20:27,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 63 states have (on average 1.8571428571428572) internal successors, (117), 109 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:27,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2023-02-14 02:20:27,802 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 22 [2023-02-14 02:20:27,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:27,802 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2023-02-14 02:20:27,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 02:20:27,803 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2023-02-14 02:20:27,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 02:20:27,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:27,803 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:27,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-14 02:20:27,804 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:27,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:27,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1331086819, now seen corresponding path program 1 times [2023-02-14 02:20:27,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:27,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192094215] [2023-02-14 02:20:27,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:27,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:27,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 02:20:28,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:28,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192094215] [2023-02-14 02:20:28,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192094215] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:28,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:28,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:20:28,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717186733] [2023-02-14 02:20:28,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:28,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:20:28,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:20:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:20:28,007 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-14 02:20:28,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:28,170 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2023-02-14 02:20:28,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:20:28,170 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-14 02:20:28,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:28,172 INFO L225 Difference]: With dead ends: 114 [2023-02-14 02:20:28,175 INFO L226 Difference]: Without dead ends: 114 [2023-02-14 02:20:28,176 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-14 02:20:28,178 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 11 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:28,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 429 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-02-14 02:20:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2023-02-14 02:20:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 63 states have (on average 1.8412698412698412) internal successors, (116), 108 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2023-02-14 02:20:28,192 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 22 [2023-02-14 02:20:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:28,193 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2023-02-14 02:20:28,193 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-14 02:20:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2023-02-14 02:20:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 02:20:28,194 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:28,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:28,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-14 02:20:28,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578181, now seen corresponding path program 1 times [2023-02-14 02:20:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:28,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163425375] [2023-02-14 02:20:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:28,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:28,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:28,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:20:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:28,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163425375] [2023-02-14 02:20:28,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163425375] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:28,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284035447] [2023-02-14 02:20:28,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:28,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:28,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:28,465 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-14 02:20:28,466 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-14 02:20:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:28,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 02:20:28,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:28,584 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-14 02:20:28,618 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-14 02:20:28,639 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-14 02:20:28,663 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:20:28,663 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 18 [2023-02-14 02:20:28,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-14 02:20:28,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 02:20:28,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284035447] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:20:28,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:20:28,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-14 02:20:28,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549227252] [2023-02-14 02:20:28,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:28,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-14 02:20:28,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:28,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-14 02:20:28,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-14 02:20:28,937 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:20:29,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:29,193 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2023-02-14 02:20:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:20:29,193 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-14 02:20:29,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:29,194 INFO L225 Difference]: With dead ends: 130 [2023-02-14 02:20:29,194 INFO L226 Difference]: Without dead ends: 130 [2023-02-14 02:20:29,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-14 02:20:29,196 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 196 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:29,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 416 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 388 Invalid, 0 Unknown, 272 Unchecked, 0.2s Time] [2023-02-14 02:20:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-14 02:20:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2023-02-14 02:20:29,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 63 states have (on average 1.8253968253968254) internal successors, (115), 107 states have internal predecessors, (115), 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-14 02:20:29,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2023-02-14 02:20:29,206 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 25 [2023-02-14 02:20:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:29,206 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2023-02-14 02:20:29,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-14 02:20:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2023-02-14 02:20:29,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-14 02:20:29,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:29,207 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:29,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-14 02:20:29,412 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-14 02:20:29,413 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:29,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1025578182, now seen corresponding path program 1 times [2023-02-14 02:20:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:29,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618224889] [2023-02-14 02:20:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:29,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:29,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:29,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:29,790 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-14 02:20:29,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618224889] [2023-02-14 02:20:29,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618224889] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:29,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578604036] [2023-02-14 02:20:29,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:29,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:29,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:29,792 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-14 02:20:29,794 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-14 02:20:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:29,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 02:20:29,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:29,883 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-14 02:20:30,050 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_362 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_362))))) is different from true [2023-02-14 02:20:30,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:30,092 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 14 treesize of output 16 [2023-02-14 02:20:30,099 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:20:30,099 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-14 02:20:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-14 02:20:30,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:30,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578604036] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:30,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:20:30,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2023-02-14 02:20:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912994404] [2023-02-14 02:20:30,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:30,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 02:20:30,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:30,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 02:20:30,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=358, Unknown=1, NotChecked=38, Total=462 [2023-02-14 02:20:30,241 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 02:20:30,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:30,645 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2023-02-14 02:20:30,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:20:30,646 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-14 02:20:30,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:30,647 INFO L225 Difference]: With dead ends: 112 [2023-02-14 02:20:30,647 INFO L226 Difference]: Without dead ends: 112 [2023-02-14 02:20:30,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2023-02-14 02:20:30,647 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 117 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:30,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 625 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 788 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2023-02-14 02:20:30,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-14 02:20:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2023-02-14 02:20:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 63 states have (on average 1.8095238095238095) internal successors, (114), 106 states have internal predecessors, (114), 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-14 02:20:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2023-02-14 02:20:30,650 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 25 [2023-02-14 02:20:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:30,650 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2023-02-14 02:20:30,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-14 02:20:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2023-02-14 02:20:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 02:20:30,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:30,651 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:30,658 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-14 02:20:30,851 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-14 02:20:30,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash 131514271, now seen corresponding path program 1 times [2023-02-14 02:20:30,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:30,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515713465] [2023-02-14 02:20:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:31,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 02:20:31,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515713465] [2023-02-14 02:20:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515713465] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400025061] [2023-02-14 02:20:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:31,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:31,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:31,162 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-14 02:20:31,164 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-14 02:20:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:31,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-14 02:20:31,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:31,272 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-14 02:20:31,279 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-14 02:20:31,292 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 02:20:31,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:31,318 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-14 02:20:31,329 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-14 02:20:31,336 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2023-02-14 02:20:31,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:31,367 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-14 02:20:31,379 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-14 02:20:31,392 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:20:31,392 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-14 02:20:31,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-14 02:20:31,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:31,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400025061] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:31,500 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:20:31,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-14 02:20:31,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057524536] [2023-02-14 02:20:31,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:31,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 02:20:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 02:20:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-14 02:20:31,503 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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-14 02:20:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:31,751 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2023-02-14 02:20:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:20:31,752 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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 37 [2023-02-14 02:20:31,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:31,753 INFO L225 Difference]: With dead ends: 121 [2023-02-14 02:20:31,753 INFO L226 Difference]: Without dead ends: 121 [2023-02-14 02:20:31,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-14 02:20:31,753 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 178 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 372 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:31,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 280 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 358 Invalid, 0 Unknown, 372 Unchecked, 0.2s Time] [2023-02-14 02:20:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-02-14 02:20:31,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2023-02-14 02:20:31,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 98 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-14 02:20:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2023-02-14 02:20:31,755 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 37 [2023-02-14 02:20:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:31,756 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2023-02-14 02:20:31,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 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-14 02:20:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2023-02-14 02:20:31,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-14 02:20:31,757 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:31,757 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:31,764 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-14 02:20:31,962 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-14 02:20:31,962 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:31,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:31,962 INFO L85 PathProgramCache]: Analyzing trace with hash 131514272, now seen corresponding path program 1 times [2023-02-14 02:20:31,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:31,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297471025] [2023-02-14 02:20:31,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:31,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:32,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:32,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 02:20:32,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297471025] [2023-02-14 02:20:32,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297471025] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:32,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318541972] [2023-02-14 02:20:32,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:32,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:32,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:32,348 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-14 02:20:32,378 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-14 02:20:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:32,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 02:20:32,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:32,491 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-14 02:20:32,509 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-14 02:20:32,522 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_683 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_683) |c_#length|)))) is different from true [2023-02-14 02:20:32,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:32,549 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-14 02:20:32,562 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-14 02:20:32,567 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_684 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_684) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-14 02:20:32,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:32,607 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-14 02:20:32,646 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-14 02:20:32,650 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_685 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_685))))) is different from true [2023-02-14 02:20:32,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:32,671 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-14 02:20:32,674 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 02:20:32,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:32,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318541972] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:32,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:20:32,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-02-14 02:20:32,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13467261] [2023-02-14 02:20:32,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:32,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 02:20:32,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:32,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 02:20:32,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2023-02-14 02:20:32,733 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 02:20:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:32,955 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2023-02-14 02:20:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 02:20:32,956 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2023-02-14 02:20:32,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:32,956 INFO L225 Difference]: With dead ends: 113 [2023-02-14 02:20:32,956 INFO L226 Difference]: Without dead ends: 113 [2023-02-14 02:20:32,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=336, Unknown=3, NotChecked=120, Total=552 [2023-02-14 02:20:32,957 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 360 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:32,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 231 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 309 Invalid, 0 Unknown, 291 Unchecked, 0.2s Time] [2023-02-14 02:20:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-14 02:20:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-14 02:20:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 63 states have (on average 1.5555555555555556) internal successors, (98), 90 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2023-02-14 02:20:32,959 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 37 [2023-02-14 02:20:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:32,959 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2023-02-14 02:20:32,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 16 states have internal predecessors, (53), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-14 02:20:32,959 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2023-02-14 02:20:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:20:32,960 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:32,960 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:32,981 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-14 02:20:33,165 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-14 02:20:33,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash 931477670, now seen corresponding path program 1 times [2023-02-14 02:20:33,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:33,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143004361] [2023-02-14 02:20:33,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:33,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:33,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:33,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:33,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:33,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-14 02:20:33,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:33,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143004361] [2023-02-14 02:20:33,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143004361] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:33,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393974515] [2023-02-14 02:20:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:33,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:33,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:33,615 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-14 02:20:33,641 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-14 02:20:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:33,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 41 conjunts are in the unsatisfiable core [2023-02-14 02:20:33,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:33,767 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-14 02:20:33,910 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-14 02:20:33,986 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_846 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_846)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 02:20:34,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:34,011 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-14 02:20:34,024 INFO L321 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2023-02-14 02:20:34,025 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 23 treesize of output 24 [2023-02-14 02:20:34,071 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-14 02:20:34,074 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-02-14 02:20:34,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:34,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393974515] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:34,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:20:34,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 25 [2023-02-14 02:20:34,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763438647] [2023-02-14 02:20:34,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:34,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-14 02:20:34,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:34,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-14 02:20:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=572, Unknown=1, NotChecked=48, Total=702 [2023-02-14 02:20:34,133 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 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-14 02:20:34,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:34,671 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2023-02-14 02:20:34,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 02:20:34,671 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 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 40 [2023-02-14 02:20:34,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:34,672 INFO L225 Difference]: With dead ends: 186 [2023-02-14 02:20:34,672 INFO L226 Difference]: Without dead ends: 186 [2023-02-14 02:20:34,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=1064, Unknown=1, NotChecked=68, Total=1332 [2023-02-14 02:20:34,673 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 779 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:34,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 501 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 735 Invalid, 0 Unknown, 177 Unchecked, 0.3s Time] [2023-02-14 02:20:34,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-14 02:20:34,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 97. [2023-02-14 02:20:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 92 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-14 02:20:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2023-02-14 02:20:34,675 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 40 [2023-02-14 02:20:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:34,675 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2023-02-14 02:20:34,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.260869565217391) internal successors, (52), 22 states have internal predecessors, (52), 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-14 02:20:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2023-02-14 02:20:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-14 02:20:34,676 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:34,676 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:34,689 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-14 02:20:34,876 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-14 02:20:34,877 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:34,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash 931477671, now seen corresponding path program 1 times [2023-02-14 02:20:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:34,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625024192] [2023-02-14 02:20:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:20:35,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:35,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625024192] [2023-02-14 02:20:35,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625024192] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:35,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907228493] [2023-02-14 02:20:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:35,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:35,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:35,522 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-14 02:20:35,537 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-14 02:20:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:35,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-14 02:20:35,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:35,665 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-14 02:20:35,695 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1009 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1009))) is different from true [2023-02-14 02:20:35,700 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1009 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1009))) is different from true [2023-02-14 02:20:35,710 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:20:35,711 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 18 [2023-02-14 02:20:35,881 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 02:20:35,881 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 22 [2023-02-14 02:20:36,276 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1015 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1015) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_1014 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1014) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_1011 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1011))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-14 02:20:36,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:36,298 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 22 treesize of output 24 [2023-02-14 02:20:36,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:36,303 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 31 [2023-02-14 02:20:36,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:36,306 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 29 treesize of output 29 [2023-02-14 02:20:36,320 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-02-14 02:20:36,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-02-14 02:20:36,357 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 23 treesize of output 15 [2023-02-14 02:20:36,359 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-14 02:20:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2023-02-14 02:20:36,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:37,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907228493] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:37,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:20:37,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 40 [2023-02-14 02:20:37,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514371803] [2023-02-14 02:20:37,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:37,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-14 02:20:37,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:37,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-14 02:20:37,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1598, Unknown=4, NotChecked=246, Total=1980 [2023-02-14 02:20:37,065 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 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-14 02:20:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:38,581 INFO L93 Difference]: Finished difference Result 204 states and 222 transitions. [2023-02-14 02:20:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-14 02:20:38,581 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 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 40 [2023-02-14 02:20:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:38,582 INFO L225 Difference]: With dead ends: 204 [2023-02-14 02:20:38,582 INFO L226 Difference]: Without dead ends: 204 [2023-02-14 02:20:38,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=349, Invalid=2739, Unknown=4, NotChecked=330, Total=3422 [2023-02-14 02:20:38,584 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1745 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 536 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:38,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 595 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1182 Invalid, 0 Unknown, 536 Unchecked, 0.7s Time] [2023-02-14 02:20:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-02-14 02:20:38,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 97. [2023-02-14 02:20:38,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.5538461538461539) internal successors, (101), 92 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:38,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 107 transitions. [2023-02-14 02:20:38,586 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 107 transitions. Word has length 40 [2023-02-14 02:20:38,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:38,587 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 107 transitions. [2023-02-14 02:20:38,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 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-14 02:20:38,587 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 107 transitions. [2023-02-14 02:20:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 02:20:38,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:38,587 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:38,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-14 02:20:38,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:38,807 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:38,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:38,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1188964921, now seen corresponding path program 1 times [2023-02-14 02:20:38,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:38,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995647208] [2023-02-14 02:20:38,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:38,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:38,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:38,858 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:38,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:38,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995647208] [2023-02-14 02:20:38,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995647208] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:38,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:38,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:20:38,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322253448] [2023-02-14 02:20:38,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:38,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:20:38,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:38,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:20:38,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 02:20:38,860 INFO L87 Difference]: Start difference. First operand 97 states and 107 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-14 02:20:38,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:38,913 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-02-14 02:20:38,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:20:38,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 41 [2023-02-14 02:20:38,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:38,914 INFO L225 Difference]: With dead ends: 141 [2023-02-14 02:20:38,914 INFO L226 Difference]: Without dead ends: 141 [2023-02-14 02:20:38,914 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-14 02:20:38,914 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 64 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:38,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 223 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:20:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-14 02:20:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 98. [2023-02-14 02:20:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 66 states have (on average 1.5454545454545454) internal successors, (102), 93 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-14 02:20:38,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2023-02-14 02:20:38,917 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 41 [2023-02-14 02:20:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:38,917 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2023-02-14 02:20:38,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-14 02:20:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2023-02-14 02:20:38,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:20:38,918 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:38,918 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:38,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-14 02:20:38,918 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:38,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:38,918 INFO L85 PathProgramCache]: Analyzing trace with hash -133740632, now seen corresponding path program 1 times [2023-02-14 02:20:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:38,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872024503] [2023-02-14 02:20:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:38,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:38,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:38,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-14 02:20:39,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:39,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872024503] [2023-02-14 02:20:39,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872024503] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:39,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:39,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:20:39,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222211592] [2023-02-14 02:20:39,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:39,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:20:39,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:39,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:20:39,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:20:39,013 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-14 02:20:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:39,127 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2023-02-14 02:20:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:20:39,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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 43 [2023-02-14 02:20:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:39,128 INFO L225 Difference]: With dead ends: 113 [2023-02-14 02:20:39,128 INFO L226 Difference]: Without dead ends: 113 [2023-02-14 02:20:39,128 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-14 02:20:39,128 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 69 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:39,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 281 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-14 02:20:39,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2023-02-14 02:20:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 66 states have (on average 1.5) internal successors, (99), 90 states have internal predecessors, (99), 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-14 02:20:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2023-02-14 02:20:39,130 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 43 [2023-02-14 02:20:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:39,131 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2023-02-14 02:20:39,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 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-14 02:20:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2023-02-14 02:20:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:20:39,131 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:39,131 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:39,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-14 02:20:39,131 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:39,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash -133740631, now seen corresponding path program 1 times [2023-02-14 02:20:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:39,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536493635] [2023-02-14 02:20:39,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 02:20:39,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:39,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536493635] [2023-02-14 02:20:39,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536493635] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:39,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985816682] [2023-02-14 02:20:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:39,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:39,261 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-14 02:20:39,263 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-14 02:20:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 02:20:39,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:39,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:20:39,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985816682] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:39,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:20:39,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-14 02:20:39,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123465499] [2023-02-14 02:20:39,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:39,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:20:39,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:39,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:20:39,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 02:20:39,422 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-14 02:20:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:39,434 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2023-02-14 02:20:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 02:20:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 43 [2023-02-14 02:20:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:39,435 INFO L225 Difference]: With dead ends: 94 [2023-02-14 02:20:39,435 INFO L226 Difference]: Without dead ends: 94 [2023-02-14 02:20:39,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:20:39,435 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 83 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:39,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 192 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:20:39,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-02-14 02:20:39,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-02-14 02:20:39,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 65 states have (on average 1.4923076923076923) internal successors, (97), 89 states have internal predecessors, (97), 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-14 02:20:39,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2023-02-14 02:20:39,438 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 43 [2023-02-14 02:20:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:39,438 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2023-02-14 02:20:39,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-14 02:20:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2023-02-14 02:20:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-14 02:20:39,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:39,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:39,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-14 02:20:39,645 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-14 02:20:39,647 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -132415732, now seen corresponding path program 1 times [2023-02-14 02:20:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644387896] [2023-02-14 02:20:39,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:39,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,791 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-14 02:20:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:39,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644387896] [2023-02-14 02:20:39,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644387896] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:39,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422745323] [2023-02-14 02:20:39,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:39,793 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-14 02:20:39,796 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-14 02:20:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:39,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 02:20:39,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:39,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:20:39,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422745323] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:39,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:20:39,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-14 02:20:39,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922595064] [2023-02-14 02:20:39,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:39,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:20:39,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:39,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:20:39,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:20:39,979 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-14 02:20:40,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:40,001 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-14 02:20:40,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:20:40,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2023-02-14 02:20:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:40,002 INFO L225 Difference]: With dead ends: 91 [2023-02-14 02:20:40,002 INFO L226 Difference]: Without dead ends: 91 [2023-02-14 02:20:40,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-14 02:20:40,003 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 145 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:40,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 148 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:20:40,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-14 02:20:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-02-14 02:20:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.453125) internal successors, (93), 86 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-14 02:20:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2023-02-14 02:20:40,005 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 43 [2023-02-14 02:20:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:40,005 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2023-02-14 02:20:40,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-14 02:20:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2023-02-14 02:20:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 02:20:40,006 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:40,006 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:40,025 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-14 02:20:40,225 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-14 02:20:40,226 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:40,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:40,226 INFO L85 PathProgramCache]: Analyzing trace with hash 190077985, now seen corresponding path program 1 times [2023-02-14 02:20:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:40,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727520147] [2023-02-14 02:20:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:40,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:40,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:40,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:40,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:40,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:40,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727520147] [2023-02-14 02:20:40,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727520147] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:40,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:40,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 02:20:40,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967098695] [2023-02-14 02:20:40,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:40,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 02:20:40,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:40,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 02:20:40,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 02:20:40,307 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 02:20:40,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:40,380 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2023-02-14 02:20:40,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 02:20:40,380 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-14 02:20:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:40,381 INFO L225 Difference]: With dead ends: 108 [2023-02-14 02:20:40,381 INFO L226 Difference]: Without dead ends: 108 [2023-02-14 02:20:40,381 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-14 02:20:40,382 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 63 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:40,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 193 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:40,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-02-14 02:20:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-02-14 02:20:40,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.4375) internal successors, (92), 85 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-14 02:20:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2023-02-14 02:20:40,384 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 44 [2023-02-14 02:20:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:40,384 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2023-02-14 02:20:40,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 02:20:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2023-02-14 02:20:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 02:20:40,385 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:40,385 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:40,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-14 02:20:40,385 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:40,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:40,386 INFO L85 PathProgramCache]: Analyzing trace with hash 190077986, now seen corresponding path program 1 times [2023-02-14 02:20:40,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:40,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961670062] [2023-02-14 02:20:40,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:40,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:40,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:40,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:20:41,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:41,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961670062] [2023-02-14 02:20:41,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961670062] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:41,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156257456] [2023-02-14 02:20:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:41,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:41,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:41,235 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-14 02:20:41,245 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-14 02:20:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:41,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-14 02:20:41,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:41,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:20:41,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156257456] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:41,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:20:41,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [19] total 21 [2023-02-14 02:20:41,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526142714] [2023-02-14 02:20:41,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:41,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 02:20:41,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:41,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 02:20:41,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2023-02-14 02:20:41,430 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 02:20:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:41,497 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2023-02-14 02:20:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 02:20:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-14 02:20:41,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:41,498 INFO L225 Difference]: With dead ends: 89 [2023-02-14 02:20:41,498 INFO L226 Difference]: Without dead ends: 89 [2023-02-14 02:20:41,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2023-02-14 02:20:41,499 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 66 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:41,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 149 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 02:20:41,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-14 02:20:41,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-14 02:20:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.421875) internal successors, (91), 84 states have internal predecessors, (91), 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-14 02:20:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2023-02-14 02:20:41,501 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 44 [2023-02-14 02:20:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:41,502 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2023-02-14 02:20:41,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 02:20:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2023-02-14 02:20:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-14 02:20:41,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:41,502 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:41,517 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-14 02:20:41,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-14 02:20:41,708 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:41,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:41,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1597450267, now seen corresponding path program 1 times [2023-02-14 02:20:41,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:41,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628290985] [2023-02-14 02:20:41,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:41,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:41,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 02:20:41,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:41,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628290985] [2023-02-14 02:20:41,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628290985] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:41,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:20:41,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 02:20:41,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423422041] [2023-02-14 02:20:41,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:41,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 02:20:41,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:41,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 02:20:41,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-14 02:20:41,846 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 02:20:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:41,946 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-14 02:20:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 02:20:41,947 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-14 02:20:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:41,947 INFO L225 Difference]: With dead ends: 86 [2023-02-14 02:20:41,947 INFO L226 Difference]: Without dead ends: 86 [2023-02-14 02:20:41,947 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-14 02:20:41,948 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:41,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 284 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-14 02:20:41,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-02-14 02:20:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.375) internal successors, (88), 81 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-14 02:20:41,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2023-02-14 02:20:41,949 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 45 [2023-02-14 02:20:41,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:41,950 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2023-02-14 02:20:41,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-14 02:20:41,950 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2023-02-14 02:20:41,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:20:41,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:41,950 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:41,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-14 02:20:41,950 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash 552513247, now seen corresponding path program 1 times [2023-02-14 02:20:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:41,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703842168] [2023-02-14 02:20:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:42,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:42,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:42,494 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:20:42,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:42,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703842168] [2023-02-14 02:20:42,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703842168] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:42,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1882138079] [2023-02-14 02:20:42,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:42,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:42,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:42,495 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-14 02:20:42,498 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-14 02:20:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:42,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-14 02:20:42,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:42,781 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-14 02:20:42,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:42,944 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-14 02:20:42,954 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-02-14 02:20:42,954 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 21 treesize of output 29 [2023-02-14 02:20:43,074 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:20:43,075 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 29 treesize of output 32 [2023-02-14 02:20:43,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:43,158 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 02:20:43,158 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2023-02-14 02:20:43,177 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-14 02:20:43,262 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 69 treesize of output 45 [2023-02-14 02:20:43,333 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-14 02:20:43,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 02:20:43,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1882138079] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:20:43,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 02:20:43,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [23] total 37 [2023-02-14 02:20:43,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138917347] [2023-02-14 02:20:43,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:20:43,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 02:20:43,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:43,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 02:20:43,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1296, Unknown=1, NotChecked=0, Total=1406 [2023-02-14 02:20:43,336 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 17 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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-14 02:20:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:44,389 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2023-02-14 02:20:44,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-14 02:20:44,390 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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 49 [2023-02-14 02:20:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:44,396 INFO L225 Difference]: With dead ends: 156 [2023-02-14 02:20:44,396 INFO L226 Difference]: Without dead ends: 156 [2023-02-14 02:20:44,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=2268, Unknown=1, NotChecked=0, Total=2550 [2023-02-14 02:20:44,397 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 417 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 29 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:44,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 635 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 804 Invalid, 2 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 02:20:44,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-14 02:20:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 86. [2023-02-14 02:20:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 81 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-14 02:20:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2023-02-14 02:20:44,399 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 49 [2023-02-14 02:20:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:44,400 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2023-02-14 02:20:44,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 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-14 02:20:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2023-02-14 02:20:44,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 02:20:44,400 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:44,400 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:44,412 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-14 02:20:44,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:44,606 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:44,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:44,607 INFO L85 PathProgramCache]: Analyzing trace with hash 552513248, now seen corresponding path program 1 times [2023-02-14 02:20:44,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:44,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701432342] [2023-02-14 02:20:44,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:45,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:46,059 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:20:46,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:46,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701432342] [2023-02-14 02:20:46,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701432342] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:46,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432696152] [2023-02-14 02:20:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:46,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:46,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:46,061 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-14 02:20:46,063 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-14 02:20:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:46,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 84 conjunts are in the unsatisfiable core [2023-02-14 02:20:46,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:46,285 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-14 02:20:46,625 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-14 02:20:46,628 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-14 02:20:46,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:46,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 16 treesize of output 18 [2023-02-14 02:20:46,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:46,949 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-14 02:20:46,955 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:20:46,956 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-14 02:20:46,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:46,962 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-14 02:20:47,146 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:20:47,146 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 19 treesize of output 26 [2023-02-14 02:20:47,161 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-14 02:20:47,162 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 29 treesize of output 32 [2023-02-14 02:20:47,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:47,330 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 02:20:47,330 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 76 [2023-02-14 02:20:47,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:20:47,349 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-14 02:20:47,349 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 76 [2023-02-14 02:20:47,400 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 11 treesize of output 7 [2023-02-14 02:20:47,459 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-14 02:20:47,468 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-14 02:20:49,810 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 90 treesize of output 66 [2023-02-14 02:20:49,812 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 70 treesize of output 54 [2023-02-14 02:20:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-14 02:20:49,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:53,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432696152] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:53,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:20:53,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 21] total 51 [2023-02-14 02:20:53,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754828961] [2023-02-14 02:20:53,932 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:53,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-14 02:20:53,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:53,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-14 02:20:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3416, Unknown=10, NotChecked=0, Total=3660 [2023-02-14 02:20:53,934 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 52 states, 48 states have (on average 1.75) internal successors, (84), 45 states have internal predecessors, (84), 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-14 02:20:57,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:57,958 INFO L93 Difference]: Finished difference Result 228 states and 252 transitions. [2023-02-14 02:20:57,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-14 02:20:57,958 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 48 states have (on average 1.75) internal successors, (84), 45 states have internal predecessors, (84), 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 49 [2023-02-14 02:20:57,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:57,960 INFO L225 Difference]: With dead ends: 228 [2023-02-14 02:20:57,960 INFO L226 Difference]: Without dead ends: 228 [2023-02-14 02:20:57,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=738, Invalid=7805, Unknown=13, NotChecked=0, Total=8556 [2023-02-14 02:20:57,962 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 751 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 48 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1750 SdHoareTripleChecker+Invalid, 2622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:57,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1750 Invalid, 2622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 2570 Invalid, 4 Unknown, 0 Unchecked, 1.6s Time] [2023-02-14 02:20:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-02-14 02:20:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 92. [2023-02-14 02:20:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.352112676056338) internal successors, (96), 87 states have internal predecessors, (96), 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-14 02:20:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2023-02-14 02:20:57,965 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 49 [2023-02-14 02:20:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:57,965 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2023-02-14 02:20:57,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 48 states have (on average 1.75) internal successors, (84), 45 states have internal predecessors, (84), 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-14 02:20:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2023-02-14 02:20:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-14 02:20:57,966 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:57,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:57,972 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-14 02:20:58,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:58,172 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -220833143, now seen corresponding path program 1 times [2023-02-14 02:20:58,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:58,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397798360] [2023-02-14 02:20:58,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:58,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:58,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:20:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:20:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:58,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:20:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:20:58,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397798360] [2023-02-14 02:20:58,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397798360] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:20:58,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713887640] [2023-02-14 02:20:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:20:58,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:20:58,295 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-14 02:20:58,307 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-14 02:20:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:20:58,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 02:20:58,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:20:58,523 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-14 02:20:58,525 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-14 02:20:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:58,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:20:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:20:58,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713887640] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:20:58,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:20:58,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 11 [2023-02-14 02:20:58,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066788212] [2023-02-14 02:20:58,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:20:58,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:20:58,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:20:58,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:20:58,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 02:20:58,628 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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-14 02:20:58,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:20:58,763 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-02-14 02:20:58,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 02:20:58,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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 50 [2023-02-14 02:20:58,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:20:58,764 INFO L225 Difference]: With dead ends: 84 [2023-02-14 02:20:58,765 INFO L226 Difference]: Without dead ends: 84 [2023-02-14 02:20:58,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-02-14 02:20:58,765 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 12 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:20:58,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 531 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 02:20:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-02-14 02:20:58,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-02-14 02:20:58,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 79 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-14 02:20:58,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-02-14 02:20:58,770 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 50 [2023-02-14 02:20:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:20:58,770 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-02-14 02:20:58,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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-14 02:20:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-02-14 02:20:58,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 02:20:58,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:20:58,772 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:20:58,780 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-14 02:20:58,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-02-14 02:20:58,978 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:20:58,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:20:58,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1610711870, now seen corresponding path program 1 times [2023-02-14 02:20:58,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:20:58,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425823427] [2023-02-14 02:20:58,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:20:58,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:20:59,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:00,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:21:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:00,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:21:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:00,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:21:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:00,770 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:21:00,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:00,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425823427] [2023-02-14 02:21:00,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425823427] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:00,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528100609] [2023-02-14 02:21:00,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:00,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:00,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:00,771 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-14 02:21:00,772 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-14 02:21:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:00,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 128 conjunts are in the unsatisfiable core [2023-02-14 02:21:00,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:01,009 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-14 02:21:01,259 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-14 02:21:01,361 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:21:01,361 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-14 02:21:01,479 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 19 treesize of output 18 [2023-02-14 02:21:01,653 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-14 02:21:01,845 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 30 treesize of output 18 [2023-02-14 02:21:01,848 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-14 02:21:01,852 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-14 02:21:01,858 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-14 02:21:02,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:02,117 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 11 [2023-02-14 02:21:02,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:02,130 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 38 treesize of output 29 [2023-02-14 02:21:02,142 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:21:02,143 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-14 02:21:02,157 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 20 treesize of output 15 [2023-02-14 02:21:02,640 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:21:02,641 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 72 treesize of output 65 [2023-02-14 02:21:02,655 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 35 treesize of output 30 [2023-02-14 02:21:02,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:02,664 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-14 02:21:02,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:02,738 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 35 treesize of output 33 [2023-02-14 02:21:02,743 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-14 02:21:02,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:02,749 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-14 02:21:02,819 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 28 treesize of output 16 [2023-02-14 02:21:02,823 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-14 02:21:02,918 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-14 02:21:02,958 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-14 02:21:02,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:03,087 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2634 (Array Int Int)) (v_ArrVal_2633 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2633) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2632) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2023-02-14 02:21:05,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528100609] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:05,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 02:21:05,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 59 [2023-02-14 02:21:05,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624275918] [2023-02-14 02:21:05,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:05,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-02-14 02:21:05,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:05,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-02-14 02:21:05,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=4311, Unknown=1, NotChecked=132, Total=4692 [2023-02-14 02:21:05,325 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 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-14 02:21:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:08,065 INFO L93 Difference]: Finished difference Result 171 states and 190 transitions. [2023-02-14 02:21:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-02-14 02:21:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 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 51 [2023-02-14 02:21:08,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:08,066 INFO L225 Difference]: With dead ends: 171 [2023-02-14 02:21:08,066 INFO L226 Difference]: Without dead ends: 171 [2023-02-14 02:21:08,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2048 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=631, Invalid=7744, Unknown=1, NotChecked=180, Total=8556 [2023-02-14 02:21:08,069 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 505 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 506 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:08,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [506 Valid, 1344 Invalid, 2233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 02:21:08,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-14 02:21:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 108. [2023-02-14 02:21:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 101 states have internal predecessors, (111), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:21:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2023-02-14 02:21:08,076 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 51 [2023-02-14 02:21:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:08,077 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2023-02-14 02:21:08,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 50 states have internal predecessors, (84), 6 states have call successors, (6), 4 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-14 02:21:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2023-02-14 02:21:08,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-14 02:21:08,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:08,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:08,089 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-14 02:21:08,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-14 02:21:08,287 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:21:08,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:08,288 INFO L85 PathProgramCache]: Analyzing trace with hash -761382722, now seen corresponding path program 1 times [2023-02-14 02:21:08,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:08,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413888286] [2023-02-14 02:21:08,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:08,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:21:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:21:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:21:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-14 02:21:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:08,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413888286] [2023-02-14 02:21:08,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413888286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 02:21:08,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 02:21:08,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 02:21:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936986266] [2023-02-14 02:21:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 02:21:08,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 02:21:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:08,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 02:21:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-02-14 02:21:08,596 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 02:21:08,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:08,826 INFO L93 Difference]: Finished difference Result 150 states and 166 transitions. [2023-02-14 02:21:08,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 02:21:08,827 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2023-02-14 02:21:08,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:08,827 INFO L225 Difference]: With dead ends: 150 [2023-02-14 02:21:08,828 INFO L226 Difference]: Without dead ends: 150 [2023-02-14 02:21:08,828 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-14 02:21:08,828 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 153 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:08,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 592 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 02:21:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-14 02:21:08,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 104. [2023-02-14 02:21:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 97 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:21:08,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2023-02-14 02:21:08,831 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 51 [2023-02-14 02:21:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:08,831 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2023-02-14 02:21:08,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-14 02:21:08,831 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2023-02-14 02:21:08,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 02:21:08,832 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:08,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:08,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-14 02:21:08,832 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:21:08,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1544354016, now seen corresponding path program 1 times [2023-02-14 02:21:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:08,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775406863] [2023-02-14 02:21:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:08,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:21:08,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:21:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:21:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:21:08,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:08,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775406863] [2023-02-14 02:21:08,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775406863] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:08,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47857125] [2023-02-14 02:21:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:08,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:08,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:08,992 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-14 02:21:08,994 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-14 02:21:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:09,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 02:21:09,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:09,204 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-14 02:21:09,216 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2936 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2936))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-14 02:21:09,235 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-14 02:21:09,244 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2937 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2937))))) is different from true [2023-02-14 02:21:09,259 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-14 02:21:09,271 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2938 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2938))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2023-02-14 02:21:09,287 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-14 02:21:09,292 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-14 02:21:09,306 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-14 02:21:09,306 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-14 02:21:09,310 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 18 not checked. [2023-02-14 02:21:09,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-14 02:21:09,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47857125] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 02:21:09,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-14 02:21:09,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2023-02-14 02:21:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682720364] [2023-02-14 02:21:09,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-14 02:21:09,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-14 02:21:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-14 02:21:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-14 02:21:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2023-02-14 02:21:09,600 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-14 02:21:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 02:21:09,731 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2023-02-14 02:21:09,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 02:21:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 53 [2023-02-14 02:21:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 02:21:09,733 INFO L225 Difference]: With dead ends: 100 [2023-02-14 02:21:09,733 INFO L226 Difference]: Without dead ends: 100 [2023-02-14 02:21:09,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 96 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=247, Unknown=3, NotChecked=108, Total=462 [2023-02-14 02:21:09,734 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 210 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 216 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 02:21:09,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 193 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 164 Invalid, 0 Unknown, 216 Unchecked, 0.1s Time] [2023-02-14 02:21:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-02-14 02:21:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-02-14 02:21:09,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.2658227848101267) internal successors, (100), 93 states have internal predecessors, (100), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-14 02:21:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2023-02-14 02:21:09,736 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 53 [2023-02-14 02:21:09,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 02:21:09,736 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2023-02-14 02:21:09,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.333333333333333) internal successors, (78), 15 states have internal predecessors, (78), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-02-14 02:21:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2023-02-14 02:21:09,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-14 02:21:09,737 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 02:21:09,737 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 02:21:09,743 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-14 02:21:09,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:09,943 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-14 02:21:09,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 02:21:09,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1326985614, now seen corresponding path program 1 times [2023-02-14 02:21:09,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-14 02:21:09,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393713562] [2023-02-14 02:21:09,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:09,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-14 02:21:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-14 02:21:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:10,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-14 02:21:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:10,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-14 02:21:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:11,086 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-14 02:21:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-14 02:21:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393713562] [2023-02-14 02:21:11,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393713562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 02:21:11,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778584063] [2023-02-14 02:21:11,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 02:21:11,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-14 02:21:11,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 02:21:11,092 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-14 02:21:11,095 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-14 02:21:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 02:21:11,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-14 02:21:11,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 02:21:11,659 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-14 02:21:11,675 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-14 02:21:11,792 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 6 treesize of output 5 [2023-02-14 02:21:11,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:11,895 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-14 02:21:11,904 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-02-14 02:21:11,904 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-14 02:21:12,236 INFO L321 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2023-02-14 02:21:12,236 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 51 treesize of output 37 [2023-02-14 02:21:12,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 02:21:12,246 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 26 treesize of output 28 [2023-02-14 02:21:12,320 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-14 02:21:12,320 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 100 treesize of output 83 [2023-02-14 02:21:12,331 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 02:21:12,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 73 treesize of output 72 [2023-02-14 02:21:12,404 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 62 treesize of output 46 [2023-02-14 02:21:12,569 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-14 02:21:12,569 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 26 [2023-02-14 02:21:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-14 02:21:12,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 02:21:12,595 INFO L321 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2023-02-14 02:21:12,595 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 33 treesize of output 32 [2023-02-14 02:21:12,599 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 02:21:12,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2023-02-14 02:21:14,663 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~last~1#1.base| v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 02:21:14,689 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base|) |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_#t~mem10#1.base| v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 02:21:14,698 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_~new_node~0#1.base|)) is different from false [2023-02-14 02:21:14,706 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3130 (Array Int Int)) (v_ArrVal_3132 (Array Int Int)) (v_ArrVal_3133 (Array Int Int))) (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store (select |c_#memory_$Pointer$.base| .cse1) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_insert_~head#1.base|) |c_ULTIMATE.start_sll_circular_insert_~head#1.offset|) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3133))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3130) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base| v_ArrVal_3132) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_sll_circular_insert_#t~ret9#1.base|)) is different from false [2023-02-14 02:21:14,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:14,768 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 11796 treesize of output 11231 [2023-02-14 02:21:14,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 02:21:14,793 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 11220 treesize of output 10940 [2023-02-14 02:21:14,810 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 10932 treesize of output 10804 [2023-02-14 02:21:14,827 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 10804 treesize of output 10740