./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_unequal.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 d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:15:57,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:15:57,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:15:57,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:15:57,975 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:15:57,976 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:15:57,979 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:15:57,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:15:57,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:15:57,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:15:57,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:15:57,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:15:57,992 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:15:57,994 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:15:57,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:15:57,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:15:57,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:15:57,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:15:58,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:15:58,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:15:58,008 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:15:58,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:15:58,010 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:15:58,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:15:58,012 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:15:58,018 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:15:58,018 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:15:58,019 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:15:58,020 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:15:58,020 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:15:58,021 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:15:58,021 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:15:58,023 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:15:58,023 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:15:58,024 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:15:58,025 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:15:58,025 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:15:58,025 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:15:58,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:15:58,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:15:58,027 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:15:58,029 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:15:58,030 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 19:15:58,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:15:58,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:15:58,062 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:15:58,062 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:15:58,063 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:15:58,063 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:15:58,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:15:58,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:15:58,064 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:15:58,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:15:58,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:15:58,065 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:15:58,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:15:58,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:15:58,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:15:58,066 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:15:58,066 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:15:58,066 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:15:58,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:15:58,067 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:15:58,067 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:15:58,067 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:15:58,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:15:58,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:15:58,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:15:58,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:15:58,068 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:15:58,068 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:15:58,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:15:58,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:15:58,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2022-07-12 19:15:58,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:15:58,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:15:58,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:15:58,336 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:15:58,337 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:15:58,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-07-12 19:15:58,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d06e9a4/1624aa5d9e1945b99614497403742c38/FLAGaf1cda825 [2022-07-12 19:15:58,841 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:15:58,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-07-12 19:15:58,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d06e9a4/1624aa5d9e1945b99614497403742c38/FLAGaf1cda825 [2022-07-12 19:15:59,202 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81d06e9a4/1624aa5d9e1945b99614497403742c38 [2022-07-12 19:15:59,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:15:59,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:15:59,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:15:59,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:15:59,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:15:59,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@326c3a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59, skipping insertion in model container [2022-07-12 19:15:59,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,218 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:15:59,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:15:59,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-07-12 19:15:59,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:15:59,502 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:15:59,537 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-07-12 19:15:59,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:15:59,560 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:15:59,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59 WrapperNode [2022-07-12 19:15:59,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:15:59,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:15:59,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:15:59,562 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:15:59,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,626 INFO L137 Inliner]: procedures = 127, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 164 [2022-07-12 19:15:59,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:15:59,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:15:59,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:15:59,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:15:59,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,673 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:15:59,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:15:59,685 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:15:59,685 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:15:59,686 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (1/1) ... [2022-07-12 19:15:59,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:15:59,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:15:59,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:15:59,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:15:59,762 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:15:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:15:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:15:59,763 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:15:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:15:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:15:59,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:15:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:15:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:15:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:15:59,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:15:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 19:15:59,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:15:59,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:15:59,926 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:15:59,928 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:16:00,245 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:16:00,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:16:00,257 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 19:16:00,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:00 BoogieIcfgContainer [2022-07-12 19:16:00,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:16:00,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:16:00,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:16:00,264 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:16:00,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:15:59" (1/3) ... [2022-07-12 19:16:00,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9597a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:00, skipping insertion in model container [2022-07-12 19:16:00,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:15:59" (2/3) ... [2022-07-12 19:16:00,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a9597a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:16:00, skipping insertion in model container [2022-07-12 19:16:00,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:16:00" (3/3) ... [2022-07-12 19:16:00,266 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-07-12 19:16:00,278 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:16:00,279 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-07-12 19:16:00,322 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:16:00,329 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@606762a0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@560e6f96 [2022-07-12 19:16:00,329 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-07-12 19:16:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:00,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:00,344 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:00,345 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:00,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:00,351 INFO L85 PathProgramCache]: Analyzing trace with hash 895983381, now seen corresponding path program 1 times [2022-07-12 19:16:00,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:00,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590759557] [2022-07-12 19:16:00,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:00,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:00,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:00,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590759557] [2022-07-12 19:16:00,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590759557] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:00,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:00,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:00,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145094448] [2022-07-12 19:16:00,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:00,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:00,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:00,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:00,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:00,594 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:00,748 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-12 19:16:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:00,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:16:00,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:00,759 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:16:00,760 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:16:00,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:00,765 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:00,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:16:00,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-12 19:16:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.955223880597015) internal successors, (131), 122 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:00,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-07-12 19:16:00,821 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 6 [2022-07-12 19:16:00,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:00,822 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-07-12 19:16:00,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:00,823 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-07-12 19:16:00,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:16:00,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:00,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:16:00,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:16:00,824 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:00,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash 895983382, now seen corresponding path program 1 times [2022-07-12 19:16:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:00,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427219184] [2022-07-12 19:16:00,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:00,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427219184] [2022-07-12 19:16:00,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427219184] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:00,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:00,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:16:00,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112170934] [2022-07-12 19:16:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:00,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:16:00,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:00,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:16:00,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:00,923 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:01,015 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-07-12 19:16:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:16:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:16:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:01,020 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:16:01,020 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:16:01,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:16:01,025 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:01,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 209 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:01,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:16:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 19:16:01,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-07-12 19:16:01,045 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 6 [2022-07-12 19:16:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:01,047 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-07-12 19:16:01,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:16:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-07-12 19:16:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:16:01,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:01,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:01,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:16:01,049 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:01,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash 229520599, now seen corresponding path program 1 times [2022-07-12 19:16:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:01,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253292331] [2022-07-12 19:16:01,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:01,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253292331] [2022-07-12 19:16:01,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253292331] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:01,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:01,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:16:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588289844] [2022-07-12 19:16:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:16:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:16:01,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:01,193 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:16:01,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:01,307 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-07-12 19:16:01,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:01,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-12 19:16:01,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:01,309 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:16:01,309 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:16:01,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:16:01,310 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 5 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:01,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 311 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:01,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:16:01,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-07-12 19:16:01,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 68 states have (on average 1.911764705882353) internal successors, (130), 121 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:01,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-07-12 19:16:01,325 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 13 [2022-07-12 19:16:01,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:01,326 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-07-12 19:16:01,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:16:01,326 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-07-12 19:16:01,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:01,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:01,327 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:01,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:16:01,328 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:01,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:01,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414876, now seen corresponding path program 1 times [2022-07-12 19:16:01,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:01,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85388474] [2022-07-12 19:16:01,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:01,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,503 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:01,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:01,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85388474] [2022-07-12 19:16:01,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85388474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:01,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:01,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:01,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987075871] [2022-07-12 19:16:01,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:01,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:01,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:01,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:01,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:01,505 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:01,746 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-12 19:16:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:01,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:16:01,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:01,749 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:16:01,749 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:16:01,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:01,750 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 13 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:01,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 444 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:16:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-07-12 19:16:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-07-12 19:16:01,756 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 22 [2022-07-12 19:16:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:01,757 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-07-12 19:16:01,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-07-12 19:16:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:16:01,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:01,758 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:01,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:16:01,759 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:01,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414877, now seen corresponding path program 1 times [2022-07-12 19:16:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:01,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822199003] [2022-07-12 19:16:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:01,888 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:01,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:01,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822199003] [2022-07-12 19:16:01,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822199003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:01,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:01,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:01,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507622232] [2022-07-12 19:16:01,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:01,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:01,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:01,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:01,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:01,892 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:02,141 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-07-12 19:16:02,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:02,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:16:02,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:02,142 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:16:02,143 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:16:02,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:02,144 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 11 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:02,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 468 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:16:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2022-07-12 19:16:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:02,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2022-07-12 19:16:02,148 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2022-07-12 19:16:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:02,148 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2022-07-12 19:16:02,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:16:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-07-12 19:16:02,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:02,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:02,149 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:02,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:16:02,149 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:02,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:02,150 INFO L85 PathProgramCache]: Analyzing trace with hash -466517819, now seen corresponding path program 1 times [2022-07-12 19:16:02,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:02,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836767277] [2022-07-12 19:16:02,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:02,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:02,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:02,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:16:02,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:02,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836767277] [2022-07-12 19:16:02,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836767277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:02,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502352057] [2022-07-12 19:16:02,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:02,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:02,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:02,323 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:02,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 19:16:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:02,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 19:16:02,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:02,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:02,561 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:16:02,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:16:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:02,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:16:02,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502352057] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:16:02,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:16:02,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2022-07-12 19:16:02,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832466572] [2022-07-12 19:16:02,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:02,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:16:02,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:02,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:16:02,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-07-12 19:16:02,910 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:03,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:03,190 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-07-12 19:16:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:03,191 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-07-12 19:16:03,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:03,191 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:16:03,192 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:16:03,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:16:03,193 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 33 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 139 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:03,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 841 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 487 Invalid, 0 Unknown, 139 Unchecked, 0.2s Time] [2022-07-12 19:16:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:16:03,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-12 19:16:03,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.7972972972972974) internal successors, (133), 124 states have internal predecessors, (133), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-07-12 19:16:03,197 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 25 [2022-07-12 19:16:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:03,198 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-07-12 19:16:03,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-07-12 19:16:03,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:16:03,199 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:03,199 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:03,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 19:16:03,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 19:16:03,400 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:03,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:03,400 INFO L85 PathProgramCache]: Analyzing trace with hash -466517818, now seen corresponding path program 1 times [2022-07-12 19:16:03,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:03,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528365335] [2022-07-12 19:16:03,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:03,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:03,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:03,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 19:16:03,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:03,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528365335] [2022-07-12 19:16:03,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528365335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:03,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199585675] [2022-07-12 19:16:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:03,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:03,538 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:03,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 19:16:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:03,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 19:16:03,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:03,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:03,871 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:03,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:16:03,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:16:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:03,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:06,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199585675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:06,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:06,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 18 [2022-07-12 19:16:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260530636] [2022-07-12 19:16:06,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:06,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 19:16:06,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:06,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 19:16:06,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-07-12 19:16:06,070 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:16:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:06,619 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-07-12 19:16:06,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:06,619 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2022-07-12 19:16:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:06,620 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:16:06,620 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:16:06,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2022-07-12 19:16:06,621 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 22 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:06,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 941 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 711 Invalid, 0 Unknown, 121 Unchecked, 0.4s Time] [2022-07-12 19:16:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:16:06,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2022-07-12 19:16:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.7837837837837838) internal successors, (132), 123 states have internal predecessors, (132), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:06,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 138 transitions. [2022-07-12 19:16:06,625 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 138 transitions. Word has length 25 [2022-07-12 19:16:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:06,626 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 138 transitions. [2022-07-12 19:16:06,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 14 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-12 19:16:06,626 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 138 transitions. [2022-07-12 19:16:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:06,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:06,627 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:06,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:06,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-12 19:16:06,847 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:06,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:06,848 INFO L85 PathProgramCache]: Analyzing trace with hash -342690401, now seen corresponding path program 1 times [2022-07-12 19:16:06,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:06,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666583030] [2022-07-12 19:16:06,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:06,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:06,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:07,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:07,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:07,127 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:07,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:07,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666583030] [2022-07-12 19:16:07,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666583030] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:07,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889649103] [2022-07-12 19:16:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:07,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:07,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:07,132 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:07,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 19:16:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:07,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 19:16:07,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:07,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:07,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:16:07,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:16:07,520 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:07,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:16:07,531 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 19:16:07,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:07,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889649103] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:07,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:07,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2022-07-12 19:16:07,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956146207] [2022-07-12 19:16:07,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:07,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 19:16:07,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 19:16:07,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:16:07,672 INFO L87 Difference]: Start difference. First operand 129 states and 138 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:08,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:08,033 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2022-07-12 19:16:08,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2022-07-12 19:16:08,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:08,035 INFO L225 Difference]: With dead ends: 153 [2022-07-12 19:16:08,035 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 19:16:08,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-12 19:16:08,036 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 158 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 83 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:08,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 547 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 492 Invalid, 0 Unknown, 83 Unchecked, 0.3s Time] [2022-07-12 19:16:08,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 19:16:08,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 133. [2022-07-12 19:16:08,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 125 states have internal predecessors, (136), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:08,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 146 transitions. [2022-07-12 19:16:08,040 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 146 transitions. Word has length 37 [2022-07-12 19:16:08,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:08,041 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 146 transitions. [2022-07-12 19:16:08,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:08,041 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 146 transitions. [2022-07-12 19:16:08,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:16:08,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:08,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:08,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:08,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:08,252 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:08,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -342690400, now seen corresponding path program 1 times [2022-07-12 19:16:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:08,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161007508] [2022-07-12 19:16:08,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:08,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:08,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161007508] [2022-07-12 19:16:08,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161007508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:08,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:08,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:16:08,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768255091] [2022-07-12 19:16:08,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:08,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:16:08,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:08,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:16:08,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:16:08,442 INFO L87 Difference]: Start difference. First operand 133 states and 146 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:08,720 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2022-07-12 19:16:08,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:16:08,721 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:16:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:08,722 INFO L225 Difference]: With dead ends: 142 [2022-07-12 19:16:08,722 INFO L226 Difference]: Without dead ends: 142 [2022-07-12 19:16:08,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:08,722 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 324 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:08,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 221 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:08,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-12 19:16:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2022-07-12 19:16:08,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 116 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:08,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2022-07-12 19:16:08,726 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 37 [2022-07-12 19:16:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:08,727 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2022-07-12 19:16:08,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:08,727 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2022-07-12 19:16:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:16:08,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:08,728 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] [2022-07-12 19:16:08,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:16:08,728 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:08,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006624, now seen corresponding path program 1 times [2022-07-12 19:16:08,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:08,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419576401] [2022-07-12 19:16:08,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:08,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:08,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 19:16:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:08,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419576401] [2022-07-12 19:16:08,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419576401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:08,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:08,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:08,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632263153] [2022-07-12 19:16:08,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:08,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:08,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:08,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:08,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:08,818 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:08,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:08,979 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2022-07-12 19:16:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 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 39 [2022-07-12 19:16:08,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:08,981 INFO L225 Difference]: With dead ends: 140 [2022-07-12 19:16:08,981 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 19:16:08,981 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 [2022-07-12 19:16:08,981 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 86 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:08,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 308 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 19:16:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2022-07-12 19:16:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.4939759036144578) internal successors, (124), 114 states have internal predecessors, (124), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2022-07-12 19:16:08,985 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 39 [2022-07-12 19:16:08,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:08,985 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2022-07-12 19:16:08,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2022-07-12 19:16:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:16:08,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:08,986 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] [2022-07-12 19:16:08,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 19:16:08,986 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:08,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006625, now seen corresponding path program 1 times [2022-07-12 19:16:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:08,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438451161] [2022-07-12 19:16:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:09,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438451161] [2022-07-12 19:16:09,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438451161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:09,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:09,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:16:09,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775080217] [2022-07-12 19:16:09,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:09,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:16:09,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:09,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:16:09,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:16:09,081 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:09,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:09,230 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2022-07-12 19:16:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:16:09,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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 39 [2022-07-12 19:16:09,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:09,232 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:16:09,232 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:16:09,232 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 [2022-07-12 19:16:09,233 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 87 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:09,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 327 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:16:09,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 19:16:09,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:09,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2022-07-12 19:16:09,236 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 39 [2022-07-12 19:16:09,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:09,236 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2022-07-12 19:16:09,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:09,237 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2022-07-12 19:16:09,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:16:09,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:09,238 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:09,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:16:09,238 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:09,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:09,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750501, now seen corresponding path program 1 times [2022-07-12 19:16:09,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:09,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56534722] [2022-07-12 19:16:09,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:09,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,539 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 19:16:09,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:09,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56534722] [2022-07-12 19:16:09,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56534722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:09,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725309991] [2022-07-12 19:16:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:09,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:09,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:09,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:09,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 19:16:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:09,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 19:16:09,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:09,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 19:16:10,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:10,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:16:10,024 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-07-12 19:16:10,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:16:10,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:16:10,120 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:16:10,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:10,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725309991] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:10,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:16:10,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-07-12 19:16:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175323552] [2022-07-12 19:16:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:10,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:16:10,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:10,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:16:10,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=622, Unknown=2, NotChecked=0, Total=702 [2022-07-12 19:16:10,125 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:10,508 INFO L93 Difference]: Finished difference Result 176 states and 194 transitions. [2022-07-12 19:16:10,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:16:10,509 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-07-12 19:16:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:10,510 INFO L225 Difference]: With dead ends: 176 [2022-07-12 19:16:10,510 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 19:16:10,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=756, Unknown=2, NotChecked=0, Total=870 [2022-07-12 19:16:10,511 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 86 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:10,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 1033 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 611 Invalid, 0 Unknown, 169 Unchecked, 0.3s Time] [2022-07-12 19:16:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 19:16:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 119. [2022-07-12 19:16:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 84 states have (on average 1.4523809523809523) internal successors, (122), 111 states have internal predecessors, (122), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:10,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-07-12 19:16:10,516 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 41 [2022-07-12 19:16:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:10,516 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-07-12 19:16:10,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:10,516 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-07-12 19:16:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:16:10,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:10,517 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:10,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:10,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:10,728 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:10,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750502, now seen corresponding path program 1 times [2022-07-12 19:16:10,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:10,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833723589] [2022-07-12 19:16:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:10,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:10,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:10,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:11,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833723589] [2022-07-12 19:16:11,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833723589] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:11,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003100359] [2022-07-12 19:16:11,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:11,260 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:11,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 19:16:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:11,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-12 19:16:11,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:11,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:11,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-12 19:16:11,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:16:11,897 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1138 (Array Int Int)) (v_ArrVal_1137 (Array Int Int))) (and (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1137) |c_#memory_$Pointer$.offset|) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1138)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-07-12 19:16:11,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:11,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 19:16:11,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:11,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 19:16:11,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:11,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-07-12 19:16:11,960 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:16:11,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-12 19:16:12,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:16:12,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-12 19:16:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-07-12 19:16:12,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:12,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003100359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:12,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:12,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-07-12 19:16:12,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3161461] [2022-07-12 19:16:12,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:12,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-12 19:16:12,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:12,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-12 19:16:12,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2022-07-12 19:16:12,327 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:16:14,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:14,139 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-07-12 19:16:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:16:14,140 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-07-12 19:16:14,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:14,141 INFO L225 Difference]: With dead ends: 185 [2022-07-12 19:16:14,141 INFO L226 Difference]: Without dead ends: 185 [2022-07-12 19:16:14,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2022-07-12 19:16:14,142 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 407 mSDsluCounter, 1793 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 2374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:14,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1890 Invalid, 2374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2215 Invalid, 0 Unknown, 119 Unchecked, 1.2s Time] [2022-07-12 19:16:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-12 19:16:14,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 123. [2022-07-12 19:16:14,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 115 states have internal predecessors, (126), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:14,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2022-07-12 19:16:14,146 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 41 [2022-07-12 19:16:14,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:14,147 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2022-07-12 19:16:14,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:16:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2022-07-12 19:16:14,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:16:14,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:14,148 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] [2022-07-12 19:16:14,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:14,367 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,SelfDestructingSolverStorable12 [2022-07-12 19:16:14,368 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:14,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1566007957, now seen corresponding path program 1 times [2022-07-12 19:16:14,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:14,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635575295] [2022-07-12 19:16:14,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:14,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,441 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:14,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:14,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635575295] [2022-07-12 19:16:14,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635575295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:14,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:14,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:16:14,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972707173] [2022-07-12 19:16:14,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:14,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:16:14,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:14,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:16:14,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:14,444 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:14,538 INFO L93 Difference]: Finished difference Result 140 states and 154 transitions. [2022-07-12 19:16:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:16:14,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 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 42 [2022-07-12 19:16:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:14,539 INFO L225 Difference]: With dead ends: 140 [2022-07-12 19:16:14,539 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 19:16:14,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:14,540 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 100 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:14,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 192 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:14,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 19:16:14,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2022-07-12 19:16:14,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 88 states have (on average 1.4204545454545454) internal successors, (125), 114 states have internal predecessors, (125), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2022-07-12 19:16:14,543 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 42 [2022-07-12 19:16:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:14,543 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2022-07-12 19:16:14,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:14,544 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2022-07-12 19:16:14,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:16:14,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:14,544 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] [2022-07-12 19:16:14,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 19:16:14,545 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:14,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116815, now seen corresponding path program 1 times [2022-07-12 19:16:14,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:14,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924776280] [2022-07-12 19:16:14,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:14,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:14,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 19:16:14,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:14,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924776280] [2022-07-12 19:16:14,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924776280] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:14,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:14,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:16:14,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445971775] [2022-07-12 19:16:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:14,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:16:14,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:16:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:14,688 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:14,964 INFO L93 Difference]: Finished difference Result 195 states and 215 transitions. [2022-07-12 19:16:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:16:14,965 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 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 46 [2022-07-12 19:16:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:14,966 INFO L225 Difference]: With dead ends: 195 [2022-07-12 19:16:14,966 INFO L226 Difference]: Without dead ends: 195 [2022-07-12 19:16:14,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-07-12 19:16:14,966 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 429 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:14,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 447 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-12 19:16:14,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 127. [2022-07-12 19:16:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 119 states have internal predecessors, (131), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 141 transitions. [2022-07-12 19:16:14,970 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 141 transitions. Word has length 46 [2022-07-12 19:16:14,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:14,970 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 141 transitions. [2022-07-12 19:16:14,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:14,970 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 141 transitions. [2022-07-12 19:16:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:16:14,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:14,971 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] [2022-07-12 19:16:14,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 19:16:14,971 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:14,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:14,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116814, now seen corresponding path program 1 times [2022-07-12 19:16:14,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:14,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909067623] [2022-07-12 19:16:14,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:14,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:15,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:15,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:15,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909067623] [2022-07-12 19:16:15,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909067623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:15,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:15,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 19:16:15,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272965407] [2022-07-12 19:16:15,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:15,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 19:16:15,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:15,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 19:16:15,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:16:15,148 INFO L87 Difference]: Start difference. First operand 127 states and 141 transitions. Second operand has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:15,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:15,422 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2022-07-12 19:16:15,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:16:15,423 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 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 46 [2022-07-12 19:16:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:15,424 INFO L225 Difference]: With dead ends: 223 [2022-07-12 19:16:15,424 INFO L226 Difference]: Without dead ends: 223 [2022-07-12 19:16:15,425 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 [2022-07-12 19:16:15,425 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 536 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:15,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 457 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:15,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-12 19:16:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 130. [2022-07-12 19:16:15,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 122 states have internal predecessors, (134), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2022-07-12 19:16:15,429 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 46 [2022-07-12 19:16:15,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:15,429 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2022-07-12 19:16:15,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:15,429 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2022-07-12 19:16:15,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:16:15,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:15,430 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] [2022-07-12 19:16:15,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 19:16:15,430 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:15,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash 241903816, now seen corresponding path program 1 times [2022-07-12 19:16:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:15,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273440620] [2022-07-12 19:16:15,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:15,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:15,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:16,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:16,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273440620] [2022-07-12 19:16:16,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273440620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:16,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648794931] [2022-07-12 19:16:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:16,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:16,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:16,128 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:16,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 19:16:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:16,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-12 19:16:16,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:16,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:16,538 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:16,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:16:16,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:16:16,750 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:16,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 19:16:16,912 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:16,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2022-07-12 19:16:16,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:16:16,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:16:17,049 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1642 (Array Int Int)) (v_ArrVal_1641 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1642) |c_#memory_$Pointer$.offset|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#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_1641)))) is different from true [2022-07-12 19:16:17,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:17,100 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:16:17,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 43 [2022-07-12 19:16:17,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:17,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:16:17,135 INFO L356 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-07-12 19:16:17,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2022-07-12 19:16:17,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:16:17,345 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:17,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-07-12 19:16:17,429 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 19:16:17,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:17,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1653 (Array Int Int)) (v_ArrVal_1651 (Array Int Int)) (v_ArrVal_1652 Int) (|v_node_create_~temp~0#1.base_34| Int)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_1653) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_34| v_ArrVal_1652) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1651))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) .cse1)) 1) (< .cse1 0) (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_34|) 0))))) is different from false [2022-07-12 19:16:17,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648794931] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:17,618 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:17,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2022-07-12 19:16:17,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665285546] [2022-07-12 19:16:17,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:17,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-12 19:16:17,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:17,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-12 19:16:17,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2101, Unknown=2, NotChecked=186, Total=2450 [2022-07-12 19:16:17,620 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:16:18,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:18,548 INFO L93 Difference]: Finished difference Result 143 states and 161 transitions. [2022-07-12 19:16:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 19:16:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-12 19:16:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:18,550 INFO L225 Difference]: With dead ends: 143 [2022-07-12 19:16:18,550 INFO L226 Difference]: Without dead ends: 143 [2022-07-12 19:16:18,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=273, Invalid=3155, Unknown=2, NotChecked=230, Total=3660 [2022-07-12 19:16:18,551 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:18,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1249 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 880 Invalid, 0 Unknown, 246 Unchecked, 0.5s Time] [2022-07-12 19:16:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-12 19:16:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2022-07-12 19:16:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 106 states have (on average 1.3773584905660377) internal successors, (146), 131 states have internal predecessors, (146), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-07-12 19:16:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2022-07-12 19:16:18,556 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 46 [2022-07-12 19:16:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:18,556 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2022-07-12 19:16:18,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 39 states have internal predecessors, (74), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:16:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2022-07-12 19:16:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:16:18,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:18,557 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] [2022-07-12 19:16:18,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:18,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 19:16:18,770 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:18,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:18,770 INFO L85 PathProgramCache]: Analyzing trace with hash 241903817, now seen corresponding path program 1 times [2022-07-12 19:16:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:18,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587005181] [2022-07-12 19:16:18,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:18,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:19,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:19,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:19,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587005181] [2022-07-12 19:16:19,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587005181] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:19,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587509858] [2022-07-12 19:16:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:19,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:19,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:19,660 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:19,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 19:16:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:19,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-12 19:16:19,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:19,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:20,133 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:20,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 19:16:20,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:16:20,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:16:20,401 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:16:20,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-12 19:16:20,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:16:20,612 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:16:20,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 34 [2022-07-12 19:16:20,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:16:20,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:16:20,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:16:20,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:20,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:20,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:20,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-12 19:16:20,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:20,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:16:20,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:20,918 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:16:20,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-07-12 19:16:20,932 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-12 19:16:20,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-07-12 19:16:21,239 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:16:21,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 41 [2022-07-12 19:16:21,260 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:16:21,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 19:16:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:21,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:22,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587509858] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:22,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:22,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2022-07-12 19:16:22,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265640705] [2022-07-12 19:16:22,608 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:22,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 19:16:22,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:22,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 19:16:22,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=3224, Unknown=8, NotChecked=0, Total=3422 [2022-07-12 19:16:22,610 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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) [2022-07-12 19:16:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:25,821 INFO L93 Difference]: Finished difference Result 282 states and 310 transitions. [2022-07-12 19:16:25,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-12 19:16:25,822 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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 46 [2022-07-12 19:16:25,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:25,823 INFO L225 Difference]: With dead ends: 282 [2022-07-12 19:16:25,823 INFO L226 Difference]: Without dead ends: 282 [2022-07-12 19:16:25,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=439, Invalid=6031, Unknown=10, NotChecked=0, Total=6480 [2022-07-12 19:16:25,825 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 355 mSDsluCounter, 4592 mSDsCounter, 0 mSdLazyCounter, 4508 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 4744 SdHoareTripleChecker+Invalid, 4942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 386 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:25,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 4744 Invalid, 4942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 4508 Invalid, 0 Unknown, 386 Unchecked, 1.9s Time] [2022-07-12 19:16:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-12 19:16:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 146. [2022-07-12 19:16:25,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 137 states have internal predecessors, (150), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:16:25,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2022-07-12 19:16:25,830 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 46 [2022-07-12 19:16:25,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:25,830 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2022-07-12 19:16:25,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 45 states have internal predecessors, (79), 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) [2022-07-12 19:16:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2022-07-12 19:16:25,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:16:25,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:25,831 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:25,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-12 19:16:26,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:26,052 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash 881645453, now seen corresponding path program 2 times [2022-07-12 19:16:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:26,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597951289] [2022-07-12 19:16:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:26,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-12 19:16:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 19:16:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-07-12 19:16:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597951289] [2022-07-12 19:16:26,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597951289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67038786] [2022-07-12 19:16:26,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:16:26,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:26,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:26,143 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:26,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 19:16:26,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:16:26,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:16:26,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:16:26,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 19:16:26,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:16:26,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67038786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:26,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:16:26,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-07-12 19:16:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456799672] [2022-07-12 19:16:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:26,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:16:26,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:26,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:16:26,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:26,407 INFO L87 Difference]: Start difference. First operand 146 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:26,415 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-07-12 19:16:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:16:26,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-07-12 19:16:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:26,416 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:16:26,416 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:16:26,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:16:26,417 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 87 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:26,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 126 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:16:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:16:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-12 19:16:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:26,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-07-12 19:16:26,421 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 49 [2022-07-12 19:16:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:26,421 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-07-12 19:16:26,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 19:16:26,421 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-07-12 19:16:26,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:16:26,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:26,422 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:26,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:26,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:26,627 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:26,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:26,628 INFO L85 PathProgramCache]: Analyzing trace with hash 185060511, now seen corresponding path program 1 times [2022-07-12 19:16:26,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:26,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070124585] [2022-07-12 19:16:26,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:26,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:16:26,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:26,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070124585] [2022-07-12 19:16:26,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070124585] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:26,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:26,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 19:16:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019848202] [2022-07-12 19:16:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:26,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:16:26,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:16:26,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:16:26,703 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:26,860 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2022-07-12 19:16:26,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 19:16:26,860 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 49 [2022-07-12 19:16:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:26,861 INFO L225 Difference]: With dead ends: 166 [2022-07-12 19:16:26,861 INFO L226 Difference]: Without dead ends: 166 [2022-07-12 19:16:26,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:16:26,863 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 151 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:26,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 414 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:16:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-12 19:16:26,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 123. [2022-07-12 19:16:26,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.372340425531915) internal successors, (129), 117 states have internal predecessors, (129), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 135 transitions. [2022-07-12 19:16:26,867 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 135 transitions. Word has length 49 [2022-07-12 19:16:26,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:26,867 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 135 transitions. [2022-07-12 19:16:26,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:16:26,867 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 135 transitions. [2022-07-12 19:16:26,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:16:26,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:26,868 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:26,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 19:16:26,868 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:26,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:26,869 INFO L85 PathProgramCache]: Analyzing trace with hash 185060512, now seen corresponding path program 1 times [2022-07-12 19:16:26,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:26,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795183812] [2022-07-12 19:16:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:26,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,125 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:16:27,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:27,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795183812] [2022-07-12 19:16:27,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795183812] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:16:27,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:16:27,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 19:16:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221161687] [2022-07-12 19:16:27,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:16:27,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 19:16:27,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:27,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 19:16:27,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:16:27,128 INFO L87 Difference]: Start difference. First operand 123 states and 135 transitions. Second operand has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:27,460 INFO L93 Difference]: Finished difference Result 184 states and 202 transitions. [2022-07-12 19:16:27,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:16:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 49 [2022-07-12 19:16:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:27,461 INFO L225 Difference]: With dead ends: 184 [2022-07-12 19:16:27,461 INFO L226 Difference]: Without dead ends: 184 [2022-07-12 19:16:27,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:16:27,462 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 396 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:27,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 568 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:16:27,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-12 19:16:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2022-07-12 19:16:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.392156862745098) internal successors, (142), 125 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:27,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2022-07-12 19:16:27,466 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 49 [2022-07-12 19:16:27,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:27,467 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2022-07-12 19:16:27,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:16:27,467 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2022-07-12 19:16:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:16:27,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:27,468 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:27,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 19:16:27,468 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:27,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:27,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1749494887, now seen corresponding path program 1 times [2022-07-12 19:16:27,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:27,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666840901] [2022-07-12 19:16:27,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:27,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:27,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,694 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:27,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:27,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666840901] [2022-07-12 19:16:27,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666840901] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:27,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791297807] [2022-07-12 19:16:27,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:27,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:27,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:27,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:27,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 19:16:27,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:27,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-12 19:16:27,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:28,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 19:16:28,078 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2438 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2438)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|))) is different from true [2022-07-12 19:16:28,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:28,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-12 19:16:28,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 19:16:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-07-12 19:16:28,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:28,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_40| Int) (v_ArrVal_2442 (Array Int Int))) (or (not (< |v_node_create_~temp~0#1.base_40| |c_#StackHeapBarrier|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_40| v_ArrVal_2442) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) 0)))) is different from false [2022-07-12 19:16:28,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791297807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:28,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:28,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-07-12 19:16:28,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491057964] [2022-07-12 19:16:28,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:28,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 19:16:28,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 19:16:28,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-07-12 19:16:28,184 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:16:28,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:16:28,555 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2022-07-12 19:16:28,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 19:16:28,558 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-12 19:16:28,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:16:28,559 INFO L225 Difference]: With dead ends: 112 [2022-07-12 19:16:28,559 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 19:16:28,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=901, Unknown=2, NotChecked=126, Total=1190 [2022-07-12 19:16:28,560 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 362 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:16:28,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 668 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 420 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2022-07-12 19:16:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 19:16:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-12 19:16:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 106 states have internal predecessors, (116), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:16:28,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-07-12 19:16:28,563 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 51 [2022-07-12 19:16:28,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:16:28,563 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-07-12 19:16:28,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 22 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:16:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-07-12 19:16:28,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:16:28,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:16:28,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:16:28,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:16:28,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:28,778 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:16:28,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:16:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -720045115, now seen corresponding path program 2 times [2022-07-12 19:16:28,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:16:28,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822881007] [2022-07-12 19:16:28,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:16:28,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:16:28,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:29,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:16:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:16:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:16:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:16:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:16:29,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:16:29,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822881007] [2022-07-12 19:16:29,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822881007] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:29,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672067928] [2022-07-12 19:16:29,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:16:29,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:16:29,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:16:29,592 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:16:29,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 19:16:29,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:16:29,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:16:29,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-12 19:16:29,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:16:29,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:16:30,078 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:16:30,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 19:16:30,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:16:30,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:16:30,317 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:16:30,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 33 [2022-07-12 19:16:30,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:16:48,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:48,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:48,770 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:16:48,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 39 [2022-07-12 19:16:48,795 INFO L356 Elim1Store]: treesize reduction 68, result has 27.7 percent of original size [2022-07-12 19:16:48,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 70 [2022-07-12 19:16:48,808 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-12 19:16:48,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:16:51,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:51,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:51,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:16:51,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:51,685 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:16:51,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2022-07-12 19:16:51,950 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:16:51,989 INFO L356 Elim1Store]: treesize reduction 142, result has 13.4 percent of original size [2022-07-12 19:16:51,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 78 treesize of output 60 [2022-07-12 19:16:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:16:52,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:16:52,296 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-07-12 19:16:52,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-12 19:16:54,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672067928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:16:54,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:16:54,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 31] total 58 [2022-07-12 19:16:54,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483679769] [2022-07-12 19:16:54,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:16:54,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-12 19:16:54,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:16:54,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-12 19:16:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=4455, Unknown=9, NotChecked=0, Total=4692 [2022-07-12 19:16:54,420 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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) [2022-07-12 19:17:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:10,550 INFO L93 Difference]: Finished difference Result 102 states and 110 transitions. [2022-07-12 19:17:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 19:17:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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 [2022-07-12 19:17:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:10,551 INFO L225 Difference]: With dead ends: 102 [2022-07-12 19:17:10,551 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 19:17:10,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2299 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=476, Invalid=8253, Unknown=13, NotChecked=0, Total=8742 [2022-07-12 19:17:10,553 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 32 mSDsluCounter, 1974 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 2048 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:10,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 2048 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 949 Invalid, 0 Unknown, 207 Unchecked, 0.5s Time] [2022-07-12 19:17:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 19:17:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2022-07-12 19:17:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.355263157894737) internal successors, (103), 95 states have internal predecessors, (103), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:10,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2022-07-12 19:17:10,556 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 51 [2022-07-12 19:17:10,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:10,556 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2022-07-12 19:17:10,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 54 states have (on average 1.6481481481481481) internal successors, (89), 51 states have internal predecessors, (89), 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) [2022-07-12 19:17:10,557 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-07-12 19:17:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:17:10,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:10,557 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:10,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-12 19:17:10,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 19:17:10,771 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:10,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:10,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536311, now seen corresponding path program 1 times [2022-07-12 19:17:10,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:10,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421895832] [2022-07-12 19:17:10,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:10,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:11,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:11,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:11,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:11,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421895832] [2022-07-12 19:17:11,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421895832] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:11,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533176951] [2022-07-12 19:17:11,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:11,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:11,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:11,372 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:11,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 19:17:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:11,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 19:17:11,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:11,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:17:11,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:12,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:12,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-07-12 19:17:12,210 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 19:17:12,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-12 19:17:12,540 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:12,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2022-07-12 19:17:12,614 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:12,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-07-12 19:17:12,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 19:17:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:12,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:12,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533176951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:12,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:17:12,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [23] total 41 [2022-07-12 19:17:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034422098] [2022-07-12 19:17:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:12,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 19:17:12,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 19:17:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1601, Unknown=1, NotChecked=0, Total=1722 [2022-07-12 19:17:12,683 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:13,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:13,230 INFO L93 Difference]: Finished difference Result 179 states and 195 transitions. [2022-07-12 19:17:13,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:17:13,230 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-12 19:17:13,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:13,231 INFO L225 Difference]: With dead ends: 179 [2022-07-12 19:17:13,231 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 19:17:13,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=2159, Unknown=1, NotChecked=0, Total=2352 [2022-07-12 19:17:13,233 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 260 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:13,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 660 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 555 Invalid, 0 Unknown, 163 Unchecked, 0.3s Time] [2022-07-12 19:17:13,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 19:17:13,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 111. [2022-07-12 19:17:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 105 states have internal predecessors, (114), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:13,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2022-07-12 19:17:13,238 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 53 [2022-07-12 19:17:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:13,239 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2022-07-12 19:17:13,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2022-07-12 19:17:13,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:17:13,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:13,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:13,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 19:17:13,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 19:17:13,447 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536312, now seen corresponding path program 1 times [2022-07-12 19:17:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:13,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135569953] [2022-07-12 19:17:13,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:13,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:13,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:13,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,085 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:14,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:14,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135569953] [2022-07-12 19:17:14,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135569953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:14,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782505850] [2022-07-12 19:17:14,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:14,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:14,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:14,088 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:14,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 19:17:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:14,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 19:17:14,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:14,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:14,621 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2987 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2987)))) is different from true [2022-07-12 19:17:14,627 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2988 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2988)))) is different from true [2022-07-12 19:17:14,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:14,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:17:14,927 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:17:14,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-07-12 19:17:14,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:14,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-07-12 19:17:14,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:14,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-07-12 19:17:14,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:14,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2022-07-12 19:17:15,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-07-12 19:17:15,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-12 19:17:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-07-12 19:17:15,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:15,199 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2991 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_2992 (Array Int Int)) (v_ArrVal_2991 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2992) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:15,211 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2991 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2990) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (forall ((v_ArrVal_2989 (Array Int Int)) (v_ArrVal_2992 (Array Int Int)) (v_ArrVal_2991 (Array Int Int)) (v_ArrVal_2990 (Array Int Int))) (<= (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2990) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2989) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2992) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-07-12 19:17:15,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:15,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-07-12 19:17:15,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:15,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 231 [2022-07-12 19:17:15,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2022-07-12 19:17:15,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 58 [2022-07-12 19:17:15,819 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) (forall ((|v_node_create_~temp~0#1.base_46| Int)) (or (not (< |v_node_create_~temp~0#1.base_46| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_2996 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_46| v_ArrVal_2996) |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_append_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-07-12 19:17:15,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782505850] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:15,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:15,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 48 [2022-07-12 19:17:15,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437723956] [2022-07-12 19:17:15,821 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:15,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-12 19:17:15,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:17:15,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-12 19:17:15,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2504, Unknown=6, NotChecked=520, Total=3192 [2022-07-12 19:17:15,822 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 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) [2022-07-12 19:17:17,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:17,430 INFO L93 Difference]: Finished difference Result 100 states and 107 transitions. [2022-07-12 19:17:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 19:17:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 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 53 [2022-07-12 19:17:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:17,431 INFO L225 Difference]: With dead ends: 100 [2022-07-12 19:17:17,431 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 19:17:17,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=356, Invalid=4769, Unknown=7, NotChecked=720, Total=5852 [2022-07-12 19:17:17,432 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 163 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:17,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1049 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1075 Invalid, 0 Unknown, 192 Unchecked, 0.5s Time] [2022-07-12 19:17:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 19:17:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-12 19:17:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 94 states have internal predecessors, (101), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2022-07-12 19:17:17,435 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 53 [2022-07-12 19:17:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:17,435 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2022-07-12 19:17:17,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 45 states have (on average 2.0444444444444443) internal successors, (92), 42 states have internal predecessors, (92), 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) [2022-07-12 19:17:17,436 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2022-07-12 19:17:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:17:17,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:17,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:17,454 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 19:17:17,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 19:17:17,639 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:17,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:17,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1012998182, now seen corresponding path program 1 times [2022-07-12 19:17:17,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:17:17,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397224176] [2022-07-12 19:17:17,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:17,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:17:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 19:17:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 19:17:18,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-12 19:17:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 19:17:18,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:17:18,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397224176] [2022-07-12 19:17:18,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397224176] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:18,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722857910] [2022-07-12 19:17:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:18,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:17:18,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:18,607 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 19:17:18,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 19:17:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:18,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-12 19:17:18,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:19,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-07-12 19:17:19,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:19,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:19,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:17:19,590 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-12 19:17:19,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-12 19:17:19,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:19,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 19:17:20,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:17:20,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-07-12 19:17:20,186 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-12 19:17:20,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 32 [2022-07-12 19:17:20,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:20,312 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 19:17:20,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2022-07-12 19:17:20,318 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 19:17:20,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:20,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 19:17:20,532 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-12 19:17:20,537 INFO L158 Benchmark]: Toolchain (without parser) took 81331.47ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 76.6MB in the beginning and 54.3MB in the end (delta: 22.3MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2022-07-12 19:17:20,537 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:17:20,537 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.41ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 77.8MB in the end (delta: -1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 19:17:20,537 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.55ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:17:20,537 INFO L158 Benchmark]: Boogie Preprocessor took 56.14ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:17:20,537 INFO L158 Benchmark]: RCFGBuilder took 574.57ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 52.0MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-07-12 19:17:20,537 INFO L158 Benchmark]: TraceAbstraction took 80275.60ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 51.7MB in the beginning and 54.3MB in the end (delta: -2.6MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2022-07-12 19:17:20,538 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 51.7MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.41ms. Allocated memory is still 109.1MB. Free memory was 75.9MB in the beginning and 77.8MB in the end (delta: -1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.55ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 75.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.14ms. Allocated memory is still 109.1MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 574.57ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 52.0MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 80275.60ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 51.7MB in the beginning and 54.3MB in the end (delta: -2.6MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-12 19:17:20,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_append_unequal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 19:17:22,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:17:22,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:17:22,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:17:22,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:17:22,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:17:22,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:17:22,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:17:22,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:17:22,384 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:17:22,385 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:17:22,389 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:17:22,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:17:22,393 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:17:22,394 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:17:22,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:17:22,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:17:22,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:17:22,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:17:22,405 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:17:22,406 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:17:22,407 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:17:22,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:17:22,410 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:17:22,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:17:22,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:17:22,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:17:22,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:17:22,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:17:22,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:17:22,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:17:22,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:17:22,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:17:22,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:17:22,419 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:17:22,420 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:17:22,420 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:17:22,421 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:17:22,421 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:17:22,421 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:17:22,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:17:22,425 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:17:22,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 19:17:22,457 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:17:22,458 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:17:22,458 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:17:22,458 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:17:22,459 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:17:22,459 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:17:22,460 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:17:22,460 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:17:22,460 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:17:22,461 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:17:22,461 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 19:17:22,461 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:17:22,462 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:17:22,462 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 19:17:22,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:17:22,468 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:17:22,469 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:17:22,469 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:17:22,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:17:22,469 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:17:22,469 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 19:17:22,469 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 19:17:22,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 19:17:22,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:17:22,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:17:22,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:17:22,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:17:22,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:17:22,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:17:22,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:17:22,471 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 19:17:22,472 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:22,472 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 19:17:22,472 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d83e632829c1e193271bd76b90e08187eb94c70000e5f11d7aea101b3ec9a9e6 [2022-07-12 19:17:22,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:17:22,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:17:22,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:17:22,797 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:17:22,797 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:17:22,799 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-07-12 19:17:22,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8b814e1/0a325be824f747b788475444fb55cffb/FLAG48d12ce05 [2022-07-12 19:17:23,345 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:17:23,346 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i [2022-07-12 19:17:23,355 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8b814e1/0a325be824f747b788475444fb55cffb/FLAG48d12ce05 [2022-07-12 19:17:23,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d8b814e1/0a325be824f747b788475444fb55cffb [2022-07-12 19:17:23,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:17:23,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:17:23,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:17:23,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:17:23,849 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:17:23,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:17:23" (1/1) ... [2022-07-12 19:17:23,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe06e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:23, skipping insertion in model container [2022-07-12 19:17:23,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:17:23" (1/1) ... [2022-07-12 19:17:23,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:17:23,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:17:24,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-07-12 19:17:24,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:17:24,235 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:17:24,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_append_unequal.i[24587,24600] [2022-07-12 19:17:24,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:17:24,332 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:17:24,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24 WrapperNode [2022-07-12 19:17:24,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:17:24,335 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:17:24,335 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:17:24,335 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:17:24,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,364 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,400 INFO L137 Inliner]: procedures = 130, calls = 46, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 165 [2022-07-12 19:17:24,400 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:17:24,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:17:24,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:17:24,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:17:24,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,436 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:17:24,448 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:17:24,448 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:17:24,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:17:24,449 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (1/1) ... [2022-07-12 19:17:24,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:17:24,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:17:24,476 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 19:17:24,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 19:17:24,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 19:17:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-07-12 19:17:24,520 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-07-12 19:17:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 19:17:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 19:17:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:17:24,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 19:17:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 19:17:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:17:24,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 19:17:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 19:17:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 19:17:24,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:17:24,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:17:24,685 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:17:24,700 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:17:25,215 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:17:25,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:17:25,221 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 19:17:25,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:17:25 BoogieIcfgContainer [2022-07-12 19:17:25,223 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:17:25,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:17:25,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:17:25,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:17:25,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:17:23" (1/3) ... [2022-07-12 19:17:25,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4ff42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:17:25, skipping insertion in model container [2022-07-12 19:17:25,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:17:24" (2/3) ... [2022-07-12 19:17:25,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4ff42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:17:25, skipping insertion in model container [2022-07-12 19:17:25,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:17:25" (3/3) ... [2022-07-12 19:17:25,229 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2c_append_unequal.i [2022-07-12 19:17:25,240 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:17:25,241 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 58 error locations. [2022-07-12 19:17:25,286 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:17:25,298 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2c52338b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@9037870 [2022-07-12 19:17:25,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 58 error locations. [2022-07-12 19:17:25,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:17:25,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:25,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:17:25,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:25,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:25,313 INFO L85 PathProgramCache]: Analyzing trace with hash 895983381, now seen corresponding path program 1 times [2022-07-12 19:17:25,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:25,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [360492143] [2022-07-12 19:17:25,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:25,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:25,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:25,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:25,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 19:17:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:25,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 19:17:25,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:25,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:25,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:25,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:25,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [360492143] [2022-07-12 19:17:25,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [360492143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:25,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:25,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:25,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10089287] [2022-07-12 19:17:25,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:25,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:25,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:25,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:25,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:25,566 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 127 states have internal predecessors, (143), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:25,800 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-07-12 19:17:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:17:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:25,809 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:17:25,809 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 19:17:25,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:25,816 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 8 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:25,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 207 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 19:17:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-12 19:17:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 67 states have (on average 1.955223880597015) internal successors, (131), 122 states have internal predecessors, (131), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:25,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-07-12 19:17:25,868 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 6 [2022-07-12 19:17:25,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:25,869 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-07-12 19:17:25,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-07-12 19:17:25,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:17:25,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:25,870 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:17:25,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:26,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:26,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:26,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:26,072 INFO L85 PathProgramCache]: Analyzing trace with hash 895983382, now seen corresponding path program 1 times [2022-07-12 19:17:26,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:26,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522857882] [2022-07-12 19:17:26,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:26,073 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:26,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:26,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:26,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 19:17:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:26,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:17:26,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:26,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:26,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:26,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:26,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522857882] [2022-07-12 19:17:26,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522857882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:26,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:26,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333281973] [2022-07-12 19:17:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:26,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:26,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:26,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:26,207 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:26,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:26,425 INFO L93 Difference]: Finished difference Result 125 states and 135 transitions. [2022-07-12 19:17:26,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 19:17:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:26,428 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:17:26,428 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:17:26,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:26,429 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:26,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 209 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:17:26,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-12 19:17:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 67 states have (on average 1.9253731343283582) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:26,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-07-12 19:17:26,443 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 6 [2022-07-12 19:17:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:26,445 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-07-12 19:17:26,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 19:17:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-07-12 19:17:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 19:17:26,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:26,447 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:26,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:26,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:26,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:26,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:26,657 INFO L85 PathProgramCache]: Analyzing trace with hash 229520599, now seen corresponding path program 1 times [2022-07-12 19:17:26,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:26,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611975973] [2022-07-12 19:17:26,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:26,658 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:26,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:26,660 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:26,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 19:17:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:26,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:17:26,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:26,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:26,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:26,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611975973] [2022-07-12 19:17:26,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611975973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:26,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:26,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:17:26,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887459006] [2022-07-12 19:17:26,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:26,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:26,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:26,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:26,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:26,784 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:17:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:26,794 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-07-12 19:17:26,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-07-12 19:17:26,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:26,796 INFO L225 Difference]: With dead ends: 132 [2022-07-12 19:17:26,796 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 19:17:26,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:26,797 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 5 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:26,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:17:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 19:17:26,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 126. [2022-07-12 19:17:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 68 states have (on average 1.911764705882353) internal successors, (130), 121 states have internal predecessors, (130), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-07-12 19:17:26,806 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 13 [2022-07-12 19:17:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:26,806 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-07-12 19:17:26,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-12 19:17:26,807 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-07-12 19:17:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:17:26,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:26,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:26,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:27,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:27,017 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:27,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414876, now seen corresponding path program 1 times [2022-07-12 19:17:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917542572] [2022-07-12 19:17:27,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:27,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:27,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 19:17:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:27,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:17:27,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:27,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:27,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:27,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:27,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:27,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917542572] [2022-07-12 19:17:27,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917542572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:27,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:27,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:27,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493092667] [2022-07-12 19:17:27,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:27,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:27,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:27,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:27,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:27,155 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:27,518 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-12 19:17:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:17:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:27,521 INFO L225 Difference]: With dead ends: 126 [2022-07-12 19:17:27,521 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 19:17:27,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:27,522 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:27,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 400 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:17:27,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 19:17:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-07-12 19:17:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 120 states have internal predecessors, (129), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-07-12 19:17:27,528 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 22 [2022-07-12 19:17:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:27,529 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-07-12 19:17:27,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-07-12 19:17:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 19:17:27,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:27,530 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:27,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 19:17:27,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:27,738 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:27,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:27,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2102414877, now seen corresponding path program 1 times [2022-07-12 19:17:27,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:27,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546702543] [2022-07-12 19:17:27,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:27,739 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:27,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:27,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:27,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 19:17:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:27,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:17:27,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:27,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:27,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:27,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:27,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:27,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546702543] [2022-07-12 19:17:27,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546702543] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:27,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:27,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:27,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440058070] [2022-07-12 19:17:27,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:27,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:27,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:27,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:27,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:27,916 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:28,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:28,291 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-07-12 19:17:28,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:28,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-07-12 19:17:28,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:28,293 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:17:28,293 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:17:28,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:28,295 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 11 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:28,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 424 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:17:28,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:17:28,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2022-07-12 19:17:28,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:28,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2022-07-12 19:17:28,301 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 22 [2022-07-12 19:17:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:28,301 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2022-07-12 19:17:28,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 19:17:28,302 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-07-12 19:17:28,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:17:28,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:28,303 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:28,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:28,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:28,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:28,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:28,519 INFO L85 PathProgramCache]: Analyzing trace with hash -466517819, now seen corresponding path program 1 times [2022-07-12 19:17:28,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:28,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122235126] [2022-07-12 19:17:28,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:28,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:28,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:28,521 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:28,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 19:17:28,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:28,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 19:17:28,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:28,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:28,778 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:28,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-12 19:17:28,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:28,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:28,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:28,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:28,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122235126] [2022-07-12 19:17:28,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1122235126] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:28,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:28,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-12 19:17:28,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644770015] [2022-07-12 19:17:28,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:28,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:17:28,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:28,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:17:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 19:17:28,990 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:29,308 INFO L93 Difference]: Finished difference Result 123 states and 133 transitions. [2022-07-12 19:17:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 19:17:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-12 19:17:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:29,309 INFO L225 Difference]: With dead ends: 123 [2022-07-12 19:17:29,309 INFO L226 Difference]: Without dead ends: 123 [2022-07-12 19:17:29,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:17:29,310 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:29,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 519 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 283 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2022-07-12 19:17:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-12 19:17:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-12 19:17:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 118 states have internal predecessors, (127), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-07-12 19:17:29,319 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 25 [2022-07-12 19:17:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:29,319 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-07-12 19:17:29,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:29,320 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-07-12 19:17:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 19:17:29,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:29,321 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:29,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:29,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:29,525 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:29,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -466517818, now seen corresponding path program 1 times [2022-07-12 19:17:29,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:29,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617496160] [2022-07-12 19:17:29,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:29,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:29,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:29,527 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:29,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 19:17:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:29,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:17:29,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:29,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:29,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:29,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:29,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:29,856 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:29,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-12 19:17:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:29,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:33,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:33,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617496160] [2022-07-12 19:17:33,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617496160] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:33,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [923816800] [2022-07-12 19:17:33,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:33,011 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:33,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:33,014 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:33,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-07-12 19:17:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:33,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 19:17:33,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:33,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:33,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:35,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:35,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:35,376 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:35,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-12 19:17:35,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:35,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:37,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [923816800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:37,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:37,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-12 19:17:37,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21730033] [2022-07-12 19:17:37,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:37,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:17:37,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:37,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:17:37,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 19:17:37,844 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:17:38,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:38,525 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-07-12 19:17:38,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:17:38,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-12 19:17:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:38,528 INFO L225 Difference]: With dead ends: 133 [2022-07-12 19:17:38,528 INFO L226 Difference]: Without dead ends: 133 [2022-07-12 19:17:38,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:17:38,529 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:38,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 503 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 440 Invalid, 0 Unknown, 80 Unchecked, 0.6s Time] [2022-07-12 19:17:38,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-12 19:17:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2022-07-12 19:17:38,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 73 states have (on average 1.821917808219178) internal successors, (133), 123 states have internal predecessors, (133), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:17:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2022-07-12 19:17:38,534 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 25 [2022-07-12 19:17:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:38,535 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2022-07-12 19:17:38,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 19:17:38,535 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2022-07-12 19:17:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:38,544 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:38,544 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:38,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:38,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 19:17:38,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:38,945 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -342690401, now seen corresponding path program 1 times [2022-07-12 19:17:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:38,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193744864] [2022-07-12 19:17:38,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:38,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:38,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:38,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:38,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-12 19:17:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:39,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 19:17:39,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:39,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:39,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:39,274 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:17:39,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-12 19:17:39,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:39,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:39,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:39,576 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:17:39,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 19:17:39,609 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:39,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:39,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193744864] [2022-07-12 19:17:39,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193744864] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:39,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [452398556] [2022-07-12 19:17:39,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:39,860 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:39,864 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:39,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-12 19:17:40,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:40,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 19:17:40,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:40,175 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:17:40,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-12 19:17:40,214 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:40,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:17:40,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:40,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:40,300 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:17:40,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 31 [2022-07-12 19:17:40,398 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:40,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-07-12 19:17:40,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:40,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:40,520 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:17:40,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-12 19:17:40,722 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 19:17:40,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-07-12 19:17:40,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:40,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:40,821 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:17:40,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 40 [2022-07-12 19:17:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:17:40,945 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:40,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [452398556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:40,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:17:40,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-07-12 19:17:40,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543570146] [2022-07-12 19:17:40,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:40,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:17:40,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:40,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:17:40,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-07-12 19:17:40,947 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:41,465 INFO L93 Difference]: Finished difference Result 131 states and 143 transitions. [2022-07-12 19:17:41,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:17:41,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:17:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:41,466 INFO L225 Difference]: With dead ends: 131 [2022-07-12 19:17:41,466 INFO L226 Difference]: Without dead ends: 131 [2022-07-12 19:17:41,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-12 19:17:41,467 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 3 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:41,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 560 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 297 Invalid, 0 Unknown, 125 Unchecked, 0.4s Time] [2022-07-12 19:17:41,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-12 19:17:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2022-07-12 19:17:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 122 states have internal predecessors, (132), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:17:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-07-12 19:17:41,477 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 37 [2022-07-12 19:17:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:41,478 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-07-12 19:17:41,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-07-12 19:17:41,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:41,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:41,483 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:41,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:41,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:41,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:41,887 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash -342690400, now seen corresponding path program 1 times [2022-07-12 19:17:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:41,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678751188] [2022-07-12 19:17:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:41,889 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:41,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-12 19:17:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:42,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 19:17:42,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:42,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:42,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:42,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:42,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:44,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:44,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:44,258 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:17:44,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-12 19:17:44,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:46,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:46,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:46,628 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:17:46,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-12 19:17:46,702 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:17:46,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:46,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678751188] [2022-07-12 19:17:46,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678751188] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1976668431] [2022-07-12 19:17:46,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:46,913 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:46,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:46,914 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:46,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-12 19:17:47,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:47,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:17:47,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:47,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:47,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:47,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:47,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:47,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:49,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:49,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:49,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:17:49,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:49,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:17:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 19:17:49,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:49,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1976668431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:49,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:17:49,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-07-12 19:17:49,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910499797] [2022-07-12 19:17:49,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:49,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 19:17:49,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:49,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 19:17:49,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=253, Unknown=3, NotChecked=0, Total=306 [2022-07-12 19:17:49,748 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:50,121 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-07-12 19:17:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 19:17:50,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2022-07-12 19:17:50,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:50,122 INFO L225 Difference]: With dead ends: 128 [2022-07-12 19:17:50,122 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 19:17:50,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=59, Invalid=280, Unknown=3, NotChecked=0, Total=342 [2022-07-12 19:17:50,123 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 10 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:50,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 447 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2022-07-12 19:17:50,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 19:17:50,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-07-12 19:17:50,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.7945205479452055) internal successors, (131), 121 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-12 19:17:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 139 transitions. [2022-07-12 19:17:50,128 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 139 transitions. Word has length 37 [2022-07-12 19:17:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:50,128 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 139 transitions. [2022-07-12 19:17:50,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:50,129 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 139 transitions. [2022-07-12 19:17:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:17:50,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:50,134 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:50,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:50,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:50,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:50,538 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:50,538 INFO L85 PathProgramCache]: Analyzing trace with hash 787240884, now seen corresponding path program 2 times [2022-07-12 19:17:50,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:50,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033128934] [2022-07-12 19:17:50,538 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:17:50,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:50,540 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:50,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-12 19:17:50,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:17:50,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:17:50,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:17:50,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 19:17:50,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-12 19:17:50,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:50,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033128934] [2022-07-12 19:17:50,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033128934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:17:50,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:50,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 19:17:50,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187604649] [2022-07-12 19:17:50,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:50,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:50,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:50,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:50,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:50,786 INFO L87 Difference]: Start difference. First operand 127 states and 139 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:17:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:50,813 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2022-07-12 19:17:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:17:50,814 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 37 [2022-07-12 19:17:50,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:50,815 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:17:50,815 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:17:50,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:50,816 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 110 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:50,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 271 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 19:17:50,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:17:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-12 19:17:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.8088235294117647) internal successors, (123), 115 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:50,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2022-07-12 19:17:50,822 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 37 [2022-07-12 19:17:50,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:50,824 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2022-07-12 19:17:50,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-12 19:17:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2022-07-12 19:17:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:17:50,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:50,826 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] [2022-07-12 19:17:50,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:51,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:51,026 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:51,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006624, now seen corresponding path program 1 times [2022-07-12 19:17:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:51,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005327671] [2022-07-12 19:17:51,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:51,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:51,032 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:51,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-12 19:17:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:51,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:17:51,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:51,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:17:51,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:51,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:51,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005327671] [2022-07-12 19:17:51,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005327671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:51,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:51,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457677348] [2022-07-12 19:17:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:51,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:51,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:51,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:51,218 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:51,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:51,572 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2022-07-12 19:17:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:51,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 39 [2022-07-12 19:17:51,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:51,573 INFO L225 Difference]: With dead ends: 136 [2022-07-12 19:17:51,574 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 19:17:51,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:51,574 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 99 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:51,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 296 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:17:51,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 19:17:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2022-07-12 19:17:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 68 states have (on average 1.7794117647058822) internal successors, (121), 113 states have internal predecessors, (121), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:51,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2022-07-12 19:17:51,578 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 39 [2022-07-12 19:17:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:51,581 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2022-07-12 19:17:51,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2022-07-12 19:17:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:17:51,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:51,582 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] [2022-07-12 19:17:51,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-12 19:17:51,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:51,792 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:51,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006625, now seen corresponding path program 1 times [2022-07-12 19:17:51,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:51,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367159194] [2022-07-12 19:17:51,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:51,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:51,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:51,794 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:51,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-12 19:17:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:51,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 19:17:51,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:51,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:52,008 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:17:52,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:52,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:52,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367159194] [2022-07-12 19:17:52,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367159194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:52,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:52,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 19:17:52,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216387778] [2022-07-12 19:17:52,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:52,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 19:17:52,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:52,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 19:17:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:17:52,010 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:52,390 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-07-12 19:17:52,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:52,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 39 [2022-07-12 19:17:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:52,391 INFO L225 Difference]: With dead ends: 116 [2022-07-12 19:17:52,391 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 19:17:52,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:52,392 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:52,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 307 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 19:17:52,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 19:17:52,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-12 19:17:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 68 states have (on average 1.75) internal successors, (119), 111 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-07-12 19:17:52,395 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 39 [2022-07-12 19:17:52,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:52,396 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-07-12 19:17:52,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-07-12 19:17:52,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:17:52,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:52,397 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] [2022-07-12 19:17:52,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:52,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:52,603 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006880, now seen corresponding path program 1 times [2022-07-12 19:17:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1531633192] [2022-07-12 19:17:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:52,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:52,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:52,605 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:52,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-12 19:17:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:52,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 19:17:52,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:52,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:52,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:52,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1531633192] [2022-07-12 19:17:52,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1531633192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:52,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:52,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:17:52,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560809595] [2022-07-12 19:17:52,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:52,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:17:52,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:52,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:17:52,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:52,750 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:52,862 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-12 19:17:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:17:52,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 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 39 [2022-07-12 19:17:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:52,863 INFO L225 Difference]: With dead ends: 130 [2022-07-12 19:17:52,863 INFO L226 Difference]: Without dead ends: 130 [2022-07-12 19:17:52,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:17:52,863 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 91 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:52,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 106 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:17:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-12 19:17:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2022-07-12 19:17:52,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 68 states have (on average 1.6911764705882353) 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) [2022-07-12 19:17:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2022-07-12 19:17:52,868 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 39 [2022-07-12 19:17:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:52,868 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2022-07-12 19:17:52,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:17:52,869 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2022-07-12 19:17:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:17:52,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:52,869 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] [2022-07-12 19:17:52,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:53,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:53,075 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:53,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1387006881, now seen corresponding path program 1 times [2022-07-12 19:17:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:53,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551414232] [2022-07-12 19:17:53,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:53,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:53,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:53,078 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:53,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-12 19:17:53,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:53,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 19:17:53,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:53,255 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:17:53,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:17:53,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:53,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551414232] [2022-07-12 19:17:53,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551414232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:17:53,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:17:53,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:17:53,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531276039] [2022-07-12 19:17:53,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:17:53,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:17:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:53,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:17:53,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:17:53,259 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:53,443 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2022-07-12 19:17:53,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:17:53,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 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 39 [2022-07-12 19:17:53,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:53,445 INFO L225 Difference]: With dead ends: 108 [2022-07-12 19:17:53,445 INFO L226 Difference]: Without dead ends: 108 [2022-07-12 19:17:53,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:17:53,445 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 186 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:53,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 128 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 19:17:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-12 19:17:53,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-12 19:17:53,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 68 states have (on average 1.6323529411764706) internal successors, (111), 103 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:53,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2022-07-12 19:17:53,448 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 39 [2022-07-12 19:17:53,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:53,448 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2022-07-12 19:17:53,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:17:53,449 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2022-07-12 19:17:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:17:53,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:53,449 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:53,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:53,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:53,649 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:53,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750501, now seen corresponding path program 1 times [2022-07-12 19:17:53,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:53,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384885435] [2022-07-12 19:17:53,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:53,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:53,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:53,651 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:53,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-12 19:17:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:53,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 19:17:53,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:53,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:53,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:54,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 19:17:54,262 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:17:54,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2022-07-12 19:17:54,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:54,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-12 19:17:54,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-07-12 19:17:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:54,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:54,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:17:54,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384885435] [2022-07-12 19:17:54,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384885435] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:54,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1246457828] [2022-07-12 19:17:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:54,679 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:17:54,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:17:54,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:17:54,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-12 19:17:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:54,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:17:54,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:55,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:55,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-12 19:17:55,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:55,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-12 19:17:55,594 INFO L356 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-07-12 19:17:55,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 36 [2022-07-12 19:17:55,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-07-12 19:17:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:55,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:17:55,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1246457828] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:17:55,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:17:55,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 26 [2022-07-12 19:17:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383158253] [2022-07-12 19:17:55,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:17:55,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 19:17:55,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:17:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 19:17:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=704, Unknown=5, NotChecked=0, Total=812 [2022-07-12 19:17:55,915 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand has 27 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:17:56,966 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2022-07-12 19:17:56,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:17:56,966 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-07-12 19:17:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:17:56,967 INFO L225 Difference]: With dead ends: 171 [2022-07-12 19:17:56,967 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 19:17:56,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 59 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=1088, Unknown=9, NotChecked=0, Total=1260 [2022-07-12 19:17:56,968 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 105 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1367 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 401 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:17:56,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1367 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 743 Invalid, 0 Unknown, 401 Unchecked, 0.8s Time] [2022-07-12 19:17:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 19:17:56,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 107. [2022-07-12 19:17:56,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.608695652173913) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:17:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2022-07-12 19:17:56,972 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 41 [2022-07-12 19:17:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:17:56,972 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2022-07-12 19:17:56,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.125) internal successors, (51), 24 states have internal predecessors, (51), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:17:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-07-12 19:17:56,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 19:17:56,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:17:56,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:17:56,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:57,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-12 19:17:57,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:17:57,374 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:17:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:17:57,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1473750502, now seen corresponding path program 1 times [2022-07-12 19:17:57,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:17:57,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [165724061] [2022-07-12 19:17:57,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:17:57,375 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:17:57,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:17:57,376 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:17:57,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-12 19:17:57,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:17:57,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:17:57,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:17:57,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:57,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:57,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:17:57,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 19:17:57,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:17:58,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:58,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:17:58,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:58,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-12 19:17:58,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:17:58,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:17:58,254 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:17:58,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-12 19:17:58,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:17:58,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:17:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:17:58,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:00,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:00,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [165724061] [2022-07-12 19:18:00,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [165724061] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:00,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [701928988] [2022-07-12 19:18:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:00,879 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:00,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:00,880 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:00,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-07-12 19:18:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:01,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:18:01,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:01,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:01,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:01,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-12 19:18:01,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:01,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:01,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 19:18:01,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:01,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 28 [2022-07-12 19:18:01,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:01,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:18:01,917 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:18:01,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-12 19:18:02,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-12 19:18:02,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:02,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:02,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [701928988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:02,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:02,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-07-12 19:18:02,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472901848] [2022-07-12 19:18:02,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:02,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 19:18:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:02,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 19:18:02,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=760, Unknown=5, NotChecked=0, Total=870 [2022-07-12 19:18:02,541 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 25 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:18:03,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:03,691 INFO L93 Difference]: Finished difference Result 180 states and 195 transitions. [2022-07-12 19:18:03,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:18:03,692 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-07-12 19:18:03,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:03,693 INFO L225 Difference]: With dead ends: 180 [2022-07-12 19:18:03,693 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 19:18:03,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 59 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=166, Invalid=1157, Unknown=9, NotChecked=0, Total=1332 [2022-07-12 19:18:03,694 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 103 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:03,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 980 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 638 Invalid, 0 Unknown, 169 Unchecked, 0.7s Time] [2022-07-12 19:18:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 19:18:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 111. [2022-07-12 19:18:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 73 states have (on average 1.5753424657534247) internal successors, (115), 106 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) [2022-07-12 19:18:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-07-12 19:18:03,702 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 41 [2022-07-12 19:18:03,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:03,702 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-07-12 19:18:03,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 states have internal predecessors, (49), 4 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:18:03,703 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-07-12 19:18:03,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:18:03,703 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:03,703 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] [2022-07-12 19:18:03,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:03,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-12 19:18:04,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:04,108 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:04,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1566007957, now seen corresponding path program 1 times [2022-07-12 19:18:04,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:04,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886446670] [2022-07-12 19:18:04,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:04,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:04,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:04,110 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:04,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-12 19:18:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:04,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 19:18:04,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:18:04,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:04,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:04,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886446670] [2022-07-12 19:18:04,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886446670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:04,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:04,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 19:18:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130536848] [2022-07-12 19:18:04,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:04,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:18:04,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:18:04,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:18:04,288 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:04,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:04,414 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-07-12 19:18:04,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:18:04,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 42 [2022-07-12 19:18:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:04,415 INFO L225 Difference]: With dead ends: 125 [2022-07-12 19:18:04,415 INFO L226 Difference]: Without dead ends: 125 [2022-07-12 19:18:04,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:18:04,416 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 178 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:04,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 118 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:18:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-12 19:18:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-07-12 19:18:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 73 states have (on average 1.5205479452054795) internal successors, (111), 102 states have internal predecessors, (111), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:04,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2022-07-12 19:18:04,420 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 42 [2022-07-12 19:18:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:04,420 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2022-07-12 19:18:04,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:04,421 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2022-07-12 19:18:04,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 19:18:04,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:04,421 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] [2022-07-12 19:18:04,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:04,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:04,623 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1566007956, now seen corresponding path program 1 times [2022-07-12 19:18:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:04,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392696595] [2022-07-12 19:18:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:04,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:04,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:04,625 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:04,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-12 19:18:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:04,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 19:18:04,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:04,882 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:18:04,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:04,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:04,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392696595] [2022-07-12 19:18:04,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392696595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:04,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:04,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:18:04,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904974916] [2022-07-12 19:18:04,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:04,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:18:04,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:04,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:18:04,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 19:18:04,884 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:05,025 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2022-07-12 19:18:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 19:18:05,026 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 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 42 [2022-07-12 19:18:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:05,026 INFO L225 Difference]: With dead ends: 103 [2022-07-12 19:18:05,026 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 19:18:05,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-12 19:18:05,027 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 158 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:05,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 117 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 19:18:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 19:18:05,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-12 19:18:05,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 98 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:05,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-07-12 19:18:05,030 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 42 [2022-07-12 19:18:05,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:05,030 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-07-12 19:18:05,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-07-12 19:18:05,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:18:05,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:05,031 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] [2022-07-12 19:18:05,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:05,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:05,239 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:05,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:05,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116815, now seen corresponding path program 1 times [2022-07-12 19:18:05,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:05,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881842540] [2022-07-12 19:18:05,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:05,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:05,241 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:05,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-12 19:18:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:05,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:18:05,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:05,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:05,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:05,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:18:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:18:05,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:05,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881842540] [2022-07-12 19:18:05,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881842540] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:05,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:05,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:18:05,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640625000] [2022-07-12 19:18:05,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:05,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:18:05,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:05,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:18:05,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:18:05,584 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:06,116 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2022-07-12 19:18:06,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:18:06,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 46 [2022-07-12 19:18:06,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:06,117 INFO L225 Difference]: With dead ends: 176 [2022-07-12 19:18:06,117 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 19:18:06,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:18:06,118 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 426 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:06,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 407 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:18:06,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 19:18:06,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 108. [2022-07-12 19:18:06,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 79 states have (on average 1.4303797468354431) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2022-07-12 19:18:06,122 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 46 [2022-07-12 19:18:06,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:06,122 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2022-07-12 19:18:06,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2022-07-12 19:18:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:18:06,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:06,126 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] [2022-07-12 19:18:06,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:06,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:06,326 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:06,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:06,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1190116814, now seen corresponding path program 1 times [2022-07-12 19:18:06,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:06,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292220799] [2022-07-12 19:18:06,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:06,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:06,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:06,330 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:06,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-12 19:18:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:06,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:18:06,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:06,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:06,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:06,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:06,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:06,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:18:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:18:06,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:06,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292220799] [2022-07-12 19:18:06,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292220799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:06,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:06,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:18:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566504106] [2022-07-12 19:18:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:06,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:18:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:18:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:18:06,755 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:07,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:07,382 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2022-07-12 19:18:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:18:07,382 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 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 46 [2022-07-12 19:18:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:07,383 INFO L225 Difference]: With dead ends: 204 [2022-07-12 19:18:07,383 INFO L226 Difference]: Without dead ends: 204 [2022-07-12 19:18:07,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:18:07,384 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 534 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:07,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 417 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:18:07,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-12 19:18:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 111. [2022-07-12 19:18:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 106 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-07-12 19:18:07,388 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 46 [2022-07-12 19:18:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:07,388 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-07-12 19:18:07,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 9 states have internal predecessors, (34), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-07-12 19:18:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:18:07,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:07,389 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] [2022-07-12 19:18:07,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:07,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:07,595 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash 241903816, now seen corresponding path program 1 times [2022-07-12 19:18:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:07,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [195455074] [2022-07-12 19:18:07,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:07,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:07,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:07,597 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:07,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-12 19:18:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:07,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-12 19:18:07,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:07,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:08,031 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:08,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-12 19:18:08,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:08,246 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:08,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2022-07-12 19:18:08,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-12 19:18:08,397 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-12 19:18:08,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 35 [2022-07-12 19:18:08,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:18:08,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 19:18:08,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:08,728 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:18:08,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-07-12 19:18:08,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:08,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2022-07-12 19:18:08,793 INFO L356 Elim1Store]: treesize reduction 78, result has 42.2 percent of original size [2022-07-12 19:18:08,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 76 [2022-07-12 19:18:08,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2022-07-12 19:18:09,266 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-12 19:18:09,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 43 [2022-07-12 19:18:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:09,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:09,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:09,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [195455074] [2022-07-12 19:18:09,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [195455074] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:09,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [385176586] [2022-07-12 19:18:09,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:09,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:09,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:09,771 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:09,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-07-12 19:18:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:10,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 19:18:10,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:10,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:10,517 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:10,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-12 19:18:10,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:10,981 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:10,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 40 [2022-07-12 19:18:11,289 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:11,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 26 [2022-07-12 19:18:11,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:11,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-12 19:18:11,544 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-12 19:18:11,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 68 [2022-07-12 19:18:11,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:11,570 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:18:11,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 59 [2022-07-12 19:18:11,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:11,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 19:18:11,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:12,211 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:12,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 37 [2022-07-12 19:18:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:12,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:12,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [385176586] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:12,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:12,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 41 [2022-07-12 19:18:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152608244] [2022-07-12 19:18:12,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:12,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 19:18:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:12,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 19:18:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2056, Unknown=6, NotChecked=0, Total=2256 [2022-07-12 19:18:12,522 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 42 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:13,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:13,576 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-07-12 19:18:13,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 19:18:13,577 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-12 19:18:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:13,578 INFO L225 Difference]: With dead ends: 113 [2022-07-12 19:18:13,578 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 19:18:13,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 63 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1102 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=271, Invalid=2690, Unknown=9, NotChecked=0, Total=2970 [2022-07-12 19:18:13,579 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 22 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:13,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 925 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 405 Invalid, 0 Unknown, 271 Unchecked, 0.5s Time] [2022-07-12 19:18:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 19:18:13,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-07-12 19:18:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 108 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2022-07-12 19:18:13,582 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 46 [2022-07-12 19:18:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:13,582 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2022-07-12 19:18:13,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 35 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2022-07-12 19:18:13,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 19:18:13,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:13,583 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] [2022-07-12 19:18:13,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:13,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Ended with exit code 0 [2022-07-12 19:18:13,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:13,988 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:13,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 241903817, now seen corresponding path program 1 times [2022-07-12 19:18:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:13,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406513823] [2022-07-12 19:18:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:13,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:13,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:13,990 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:13,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-12 19:18:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:14,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-12 19:18:14,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:14,299 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:14,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:14,590 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:14,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-12 19:18:14,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:18:14,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:14,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:14,893 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:14,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2022-07-12 19:18:14,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:18:15,132 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-12 19:18:15,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 52 [2022-07-12 19:18:15,142 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:18:15,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-12 19:18:15,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 19:18:15,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:18:15,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:15,474 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:18:15,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 80 [2022-07-12 19:18:15,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:15,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:15,492 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:18:15,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 77 [2022-07-12 19:18:15,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:15,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-07-12 19:18:15,525 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-12 19:18:15,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 40 [2022-07-12 19:18:15,981 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-12 19:18:15,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 59 [2022-07-12 19:18:15,996 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:18:15,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2022-07-12 19:18:16,089 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:16,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:17,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:17,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406513823] [2022-07-12 19:18:17,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406513823] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:17,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [165213835] [2022-07-12 19:18:17,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:17,134 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:17,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:17,136 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:17,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2022-07-12 19:18:17,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:17,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 19:18:17,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:17,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:17,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:18,095 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:18,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-12 19:18:18,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:18:18,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:18,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:18,773 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:18:18,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 54 [2022-07-12 19:18:18,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:18:19,255 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:19,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 39 [2022-07-12 19:18:19,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:19,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 19:18:19,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:19,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 19:18:19,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:19,519 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:18:19,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 64 [2022-07-12 19:18:19,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:19,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:19,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:19,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-12 19:18:19,553 INFO L356 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-07-12 19:18:19,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-07-12 19:18:20,628 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 19:18:20,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 49 [2022-07-12 19:18:20,650 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:18:20,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-12 19:18:20,669 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:20,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:21,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [165213835] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:21,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:21,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 42 [2022-07-12 19:18:21,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938336677] [2022-07-12 19:18:21,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:21,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 19:18:21,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:21,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 19:18:21,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2153, Unknown=2, NotChecked=0, Total=2352 [2022-07-12 19:18:21,155 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 43 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:22,630 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2022-07-12 19:18:22,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:18:22,630 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 46 [2022-07-12 19:18:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:22,631 INFO L225 Difference]: With dead ends: 177 [2022-07-12 19:18:22,631 INFO L226 Difference]: Without dead ends: 177 [2022-07-12 19:18:22,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 64 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=250, Invalid=2713, Unknown=7, NotChecked=0, Total=2970 [2022-07-12 19:18:22,633 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 80 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 556 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:22,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1544 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 673 Invalid, 0 Unknown, 556 Unchecked, 0.8s Time] [2022-07-12 19:18:22,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-12 19:18:22,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2022-07-12 19:18:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 111 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2022-07-12 19:18:22,636 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 46 [2022-07-12 19:18:22,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:22,637 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2022-07-12 19:18:22,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 36 states have internal predecessors, (65), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:22,637 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2022-07-12 19:18:22,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:18:22,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:22,638 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:22,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:22,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Ended with exit code 0 [2022-07-12 19:18:23,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:23,042 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:23,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash 185060511, now seen corresponding path program 1 times [2022-07-12 19:18:23,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:23,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144149015] [2022-07-12 19:18:23,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:23,044 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:23,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-12 19:18:23,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:23,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 19:18:23,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:23,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:23,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:23,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:18:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:18:23,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:23,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:23,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144149015] [2022-07-12 19:18:23,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144149015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:23,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:23,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:18:23,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405359853] [2022-07-12 19:18:23,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:23,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:18:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:23,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:18:23,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:18:23,410 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 10 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:23,987 INFO L93 Difference]: Finished difference Result 183 states and 202 transitions. [2022-07-12 19:18:23,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:18:23,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 49 [2022-07-12 19:18:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:23,988 INFO L225 Difference]: With dead ends: 183 [2022-07-12 19:18:23,988 INFO L226 Difference]: Without dead ends: 183 [2022-07-12 19:18:23,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-12 19:18:23,989 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 284 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:23,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 434 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:18:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-12 19:18:23,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 121. [2022-07-12 19:18:23,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 116 states have internal predecessors, (132), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 138 transitions. [2022-07-12 19:18:23,993 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 138 transitions. Word has length 49 [2022-07-12 19:18:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:23,993 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 138 transitions. [2022-07-12 19:18:23,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 138 transitions. [2022-07-12 19:18:23,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 19:18:23,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:23,994 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:24,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-12 19:18:24,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:24,205 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:24,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:24,205 INFO L85 PathProgramCache]: Analyzing trace with hash 185060512, now seen corresponding path program 1 times [2022-07-12 19:18:24,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:24,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212582068] [2022-07-12 19:18:24,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:24,206 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:24,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:24,207 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:24,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-12 19:18:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:24,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 19:18:24,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:24,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:24,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:24,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:24,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:24,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-12 19:18:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:18:24,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:18:24,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:24,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212582068] [2022-07-12 19:18:24,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212582068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:18:24,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:18:24,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 19:18:24,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055828149] [2022-07-12 19:18:24,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:18:24,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 19:18:24,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:24,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 19:18:24,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 19:18:24,623 INFO L87 Difference]: Start difference. First operand 121 states and 138 transitions. Second operand has 10 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:25,218 INFO L93 Difference]: Finished difference Result 169 states and 187 transitions. [2022-07-12 19:18:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 19:18:25,219 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 49 [2022-07-12 19:18:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:25,219 INFO L225 Difference]: With dead ends: 169 [2022-07-12 19:18:25,220 INFO L226 Difference]: Without dead ends: 169 [2022-07-12 19:18:25,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-12 19:18:25,220 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 217 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:25,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 441 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 19:18:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-12 19:18:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 123. [2022-07-12 19:18:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 95 states have (on average 1.4105263157894736) internal successors, (134), 118 states have internal predecessors, (134), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 140 transitions. [2022-07-12 19:18:25,224 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 140 transitions. Word has length 49 [2022-07-12 19:18:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:25,224 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 140 transitions. [2022-07-12 19:18:25,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:18:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 140 transitions. [2022-07-12 19:18:25,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:18:25,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:25,225 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:25,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:25,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:25,435 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:25,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1749494887, now seen corresponding path program 1 times [2022-07-12 19:18:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:25,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74834336] [2022-07-12 19:18:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:25,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:25,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:25,437 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:25,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-12 19:18:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:25,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:18:25,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:25,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 19:18:26,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:26,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-07-12 19:18:26,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-12 19:18:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:26,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:26,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:26,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74834336] [2022-07-12 19:18:26,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74834336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:26,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1763024913] [2022-07-12 19:18:26,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:26,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:26,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:26,281 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:26,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-07-12 19:18:26,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:26,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 19:18:26,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:26,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 19:18:27,021 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_1913 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1913))) (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-12 19:18:27,029 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (bvult |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_1914) |c_#memory_$Pointer$.base|))) is different from true [2022-07-12 19:18:27,037 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv4294967295 32))) (exists ((v_ArrVal_1914 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_1914))) (bvult |c_node_create_#res#1.base| |c_#StackHeapBarrier|)) is different from true [2022-07-12 19:18:27,075 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:27,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-07-12 19:18:27,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:27,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2022-07-12 19:18:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2022-07-12 19:18:27,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:27,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1763024913] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:27,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:27,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2022-07-12 19:18:27,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806209411] [2022-07-12 19:18:27,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:27,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 19:18:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 19:18:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1018, Unknown=29, NotChecked=204, Total=1406 [2022-07-12 19:18:27,402 INFO L87 Difference]: Start difference. First operand 123 states and 140 transitions. Second operand has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 30 states have internal predecessors, (77), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:18:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:28,120 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-07-12 19:18:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:18:28,121 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 30 states have internal predecessors, (77), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-07-12 19:18:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:28,121 INFO L225 Difference]: With dead ends: 120 [2022-07-12 19:18:28,121 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 19:18:28,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=251, Invalid=1618, Unknown=35, NotChecked=258, Total=2162 [2022-07-12 19:18:28,123 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 51 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:28,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1008 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 265 Invalid, 0 Unknown, 460 Unchecked, 0.3s Time] [2022-07-12 19:18:28,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 19:18:28,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 104. [2022-07-12 19:18:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 99 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-07-12 19:18:28,126 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 51 [2022-07-12 19:18:28,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:28,126 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-07-12 19:18:28,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.3333333333333335) internal successors, (77), 30 states have internal predecessors, (77), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 19:18:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-07-12 19:18:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 19:18:28,127 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:28,127 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:28,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-07-12 19:18:28,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-12 19:18:28,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:28,532 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:28,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:28,532 INFO L85 PathProgramCache]: Analyzing trace with hash -720045115, now seen corresponding path program 2 times [2022-07-12 19:18:28,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:28,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139569437] [2022-07-12 19:18:28,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:18:28,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:28,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:28,534 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:28,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-12 19:18:28,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:18:28,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:18:28,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 19:18:28,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:28,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:28,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 19:18:28,920 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:28,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-07-12 19:18:29,147 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-12 19:18:29,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 42 [2022-07-12 19:18:29,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:29,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:29,496 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 19:18:29,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 52 [2022-07-12 19:18:29,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-07-12 19:18:29,795 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-12 19:18:29,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 80 [2022-07-12 19:18:29,806 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 19:18:29,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 22 [2022-07-12 19:18:29,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2022-07-12 19:18:30,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:30,136 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-12 19:18:30,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 152 treesize of output 130 [2022-07-12 19:18:30,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:30,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:30,163 INFO L356 Elim1Store]: treesize reduction 47, result has 9.6 percent of original size [2022-07-12 19:18:30,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 139 treesize of output 128 [2022-07-12 19:18:30,201 INFO L356 Elim1Store]: treesize reduction 12, result has 70.7 percent of original size [2022-07-12 19:18:30,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 49 [2022-07-12 19:18:31,210 INFO L356 Elim1Store]: treesize reduction 32, result has 28.9 percent of original size [2022-07-12 19:18:31,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 94 [2022-07-12 19:18:31,228 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 19:18:31,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 28 [2022-07-12 19:18:31,345 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:31,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:32,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139569437] [2022-07-12 19:18:32,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139569437] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:32,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [670874932] [2022-07-12 19:18:32,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:18:32,032 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:32,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:32,033 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:32,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-12 19:18:32,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 19:18:32,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:18:32,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 19:18:32,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:32,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:33,079 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:18:33,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-12 19:18:33,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:33,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:18:33,821 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:18:33,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 41 [2022-07-12 19:18:33,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 19:18:34,258 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-12 19:18:34,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 40 [2022-07-12 19:18:34,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:34,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 19:18:34,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:34,766 INFO L356 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-07-12 19:18:34,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 80 treesize of output 74 [2022-07-12 19:18:34,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:34,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:34,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:34,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-12 19:18:34,818 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-12 19:18:34,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-07-12 19:18:35,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:35,837 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-12 19:18:35,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 27 [2022-07-12 19:18:36,363 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-07-12 19:18:36,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 45 [2022-07-12 19:18:39,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:18:39,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:40,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [670874932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:40,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:18:40,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 56 [2022-07-12 19:18:40,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992755224] [2022-07-12 19:18:40,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:18:40,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-07-12 19:18:40,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:18:40,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-07-12 19:18:40,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=4817, Unknown=30, NotChecked=0, Total=5112 [2022-07-12 19:18:40,164 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 56 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:18:48,673 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-07-12 19:18:48,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 19:18:48,674 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 5 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 [2022-07-12 19:18:48,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:18:48,674 INFO L225 Difference]: With dead ends: 94 [2022-07-12 19:18:48,674 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 19:18:48,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=509, Invalid=8196, Unknown=37, NotChecked=0, Total=8742 [2022-07-12 19:18:48,676 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 30 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 19:18:48,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1580 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 903 Invalid, 0 Unknown, 369 Unchecked, 1.1s Time] [2022-07-12 19:18:48,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 19:18:48,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-07-12 19:18:48,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.3768115942028984) internal successors, (95), 88 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:18:48,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-12 19:18:48,679 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 51 [2022-07-12 19:18:48,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:18:48,679 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-12 19:18:48,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 52 states have (on average 1.7307692307692308) internal successors, (90), 47 states have internal predecessors, (90), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-12 19:18:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-12 19:18:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:18:48,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:18:48,680 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:18:48,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2022-07-12 19:18:48,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Ended with exit code 0 [2022-07-12 19:18:49,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:18:49,085 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:18:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:18:49,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536311, now seen corresponding path program 1 times [2022-07-12 19:18:49,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:18:49,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561929541] [2022-07-12 19:18:49,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:49,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:18:49,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:18:49,087 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:18:49,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-12 19:18:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:49,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 19:18:49,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:49,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:49,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:49,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:49,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:49,850 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:49,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:18:49,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:18:49,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:50,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:50,264 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:18:50,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2022-07-12 19:18:50,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:50,381 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 19:18:50,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2022-07-12 19:18:50,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:18:50,719 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:50,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 55 [2022-07-12 19:18:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:51,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:51,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2156 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2156) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-07-12 19:18:51,658 INFO L356 Elim1Store]: treesize reduction 5, result has 91.2 percent of original size [2022-07-12 19:18:51,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 175 [2022-07-12 19:18:51,797 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:18:51,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561929541] [2022-07-12 19:18:51,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561929541] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:18:51,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1429907133] [2022-07-12 19:18:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:18:51,797 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:18:51,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:18:51,798 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:18:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-07-12 19:18:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:18:52,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 19:18:52,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:18:52,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:18:52,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:18:53,215 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:18:53,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:18:53,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:18:53,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:18:53,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:18:53,759 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:18:53,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2022-07-12 19:18:54,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:18:54,250 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-12 19:18:54,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 50 [2022-07-12 19:18:54,268 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:18:54,888 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 19:18:54,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 47 [2022-07-12 19:18:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:18:57,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:18:57,678 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2240) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-12 19:18:57,809 INFO L356 Elim1Store]: treesize reduction 19, result has 64.8 percent of original size [2022-07-12 19:18:57,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2022-07-12 19:18:57,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:57,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 85 [2022-07-12 19:18:57,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 19:18:59,174 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:18:59,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2022-07-12 19:19:02,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-07-12 19:19:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 19:19:02,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1429907133] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:02,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:19:02,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [23, 23] total 59 [2022-07-12 19:19:02,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109596296] [2022-07-12 19:19:02,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:19:02,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 19:19:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:19:02,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 19:19:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=3605, Unknown=11, NotChecked=246, Total=4160 [2022-07-12 19:19:02,223 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:04,006 INFO L93 Difference]: Finished difference Result 170 states and 185 transitions. [2022-07-12 19:19:04,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 19:19:04,007 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 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 53 [2022-07-12 19:19:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:04,007 INFO L225 Difference]: With dead ends: 170 [2022-07-12 19:19:04,007 INFO L226 Difference]: Without dead ends: 170 [2022-07-12 19:19:04,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 108 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=306, Invalid=3851, Unknown=11, NotChecked=254, Total=4422 [2022-07-12 19:19:04,009 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 152 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:04,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 549 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 315 Unchecked, 0.3s Time] [2022-07-12 19:19:04,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-12 19:19:04,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 103. [2022-07-12 19:19:04,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3417721518987342) 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) [2022-07-12 19:19:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-07-12 19:19:04,012 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 53 [2022-07-12 19:19:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:04,012 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-07-12 19:19:04,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-07-12 19:19:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 19:19:04,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:04,013 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:19:04,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-12 19:19:04,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2022-07-12 19:19:04,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:19:04,424 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:19:04,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:04,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1242536312, now seen corresponding path program 1 times [2022-07-12 19:19:04,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:19:04,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218853623] [2022-07-12 19:19:04,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:04,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:19:04,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:19:04,425 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:19:04,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-12 19:19:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:04,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 19:19:04,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:04,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:19:05,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 19:19:05,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:19:05,340 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:19:05,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-12 19:19:05,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:19:05,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:19:06,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:19:06,279 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:19:06,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 52 [2022-07-12 19:19:06,302 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-12 19:19:06,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2022-07-12 19:19:06,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:06,724 INFO L356 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-07-12 19:19:06,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 79 [2022-07-12 19:19:06,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:06,761 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-12 19:19:06,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 103 [2022-07-12 19:19:07,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:07,224 INFO L356 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2022-07-12 19:19:07,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 39 [2022-07-12 19:19:07,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:07,245 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:19:07,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2022-07-12 19:19:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:19:07,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:19:07,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:19:07,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218853623] [2022-07-12 19:19:07,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218853623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:19:07,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:19:07,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-07-12 19:19:07,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446611008] [2022-07-12 19:19:07,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:19:07,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-12 19:19:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:19:07,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-12 19:19:07,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=561, Unknown=1, NotChecked=0, Total=650 [2022-07-12 19:19:07,448 INFO L87 Difference]: Start difference. First operand 103 states and 112 transitions. Second operand has 26 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:07,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:07,859 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-07-12 19:19:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 19:19:07,859 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-07-12 19:19:07,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:07,860 INFO L225 Difference]: With dead ends: 119 [2022-07-12 19:19:07,860 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 19:19:07,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=696, Unknown=1, NotChecked=0, Total=812 [2022-07-12 19:19:07,861 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 45 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 325 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:07,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 1001 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 185 Invalid, 0 Unknown, 325 Unchecked, 0.3s Time] [2022-07-12 19:19:07,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 19:19:07,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2022-07-12 19:19:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 98 states have internal predecessors, (105), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:19:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2022-07-12 19:19:07,863 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 53 [2022-07-12 19:19:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:07,864 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2022-07-12 19:19:07,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 22 states have internal predecessors, (47), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 19:19:07,864 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2022-07-12 19:19:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 19:19:07,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:07,864 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, 1] [2022-07-12 19:19:07,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-12 19:19:08,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:19:08,073 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:19:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1923815527, now seen corresponding path program 1 times [2022-07-12 19:19:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:19:08,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186912191] [2022-07-12 19:19:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:08,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:19:08,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:19:08,076 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:19:08,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-12 19:19:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:08,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 19:19:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:08,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-12 19:19:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-07-12 19:19:08,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:19:08,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:19:08,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186912191] [2022-07-12 19:19:08,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186912191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:19:08,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:19:08,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 19:19:08,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265617814] [2022-07-12 19:19:08,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:19:08,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:19:08,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:19:08,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:19:08,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 19:19:08,356 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:19:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:08,685 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-07-12 19:19:08,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 19:19:08,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 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 56 [2022-07-12 19:19:08,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:08,686 INFO L225 Difference]: With dead ends: 147 [2022-07-12 19:19:08,686 INFO L226 Difference]: Without dead ends: 147 [2022-07-12 19:19:08,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 19:19:08,687 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 153 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:08,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 332 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 19:19:08,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-12 19:19:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 104. [2022-07-12 19:19:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 80 states have (on average 1.3375) internal successors, (107), 99 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 19:19:08,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2022-07-12 19:19:08,690 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 56 [2022-07-12 19:19:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:08,690 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2022-07-12 19:19:08,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 19:19:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2022-07-12 19:19:08,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-12 19:19:08,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:08,691 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, 1] [2022-07-12 19:19:08,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-12 19:19:08,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 19:19:08,891 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:19:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:19:08,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1923815526, now seen corresponding path program 1 times [2022-07-12 19:19:08,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:19:08,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153057056] [2022-07-12 19:19:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:08,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:19:08,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:19:08,894 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:19:08,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-12 19:19:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:09,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 19:19:09,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:09,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:19:09,454 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-12 19:19:09,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-12 19:19:09,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 19:19:09,697 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:19:09,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-12 19:19:09,873 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-12 19:19:09,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-07-12 19:19:09,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-12 19:19:09,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 19:19:10,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:10,176 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-12 19:19:10,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 54 [2022-07-12 19:19:10,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:10,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2022-07-12 19:19:10,210 INFO L356 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-07-12 19:19:10,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-07-12 19:19:10,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2022-07-12 19:19:10,565 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-07-12 19:19:10,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 31 [2022-07-12 19:19:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 19:19:10,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:19:11,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 19:19:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153057056] [2022-07-12 19:19:11,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153057056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:11,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [756717992] [2022-07-12 19:19:11,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:19:11,031 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-12 19:19:11,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-12 19:19:11,036 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-12 19:19:11,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2022-07-12 19:19:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:19:11,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-12 19:19:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:19:11,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:19:12,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 19:19:12,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2022-07-12 19:19:12,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:12,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2022-07-12 19:19:12,676 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-12 19:19:12,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-12 19:19:13,478 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-12 19:19:13,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 35 [2022-07-12 19:19:13,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 19:19:13,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-07-12 19:19:13,659 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-12 19:19:13,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 68 [2022-07-12 19:19:13,681 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 19:19:13,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 55 [2022-07-12 19:19:13,839 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2022-07-12 19:19:14,217 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-12 19:19:14,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 20 [2022-07-12 19:19:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 19:19:14,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:19:14,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2557) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-12 19:19:14,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_append_~last~1#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_~last~1#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2557) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-07-12 19:19:14,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2554 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base|) |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.offset| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_append_#t~mem11#1.base| v_ArrVal_2554) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2557) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-07-12 19:19:14,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:19:14,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 388 treesize of output 348 [2022-07-12 19:19:14,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 336 treesize of output 332 [2022-07-12 19:19:14,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 332 treesize of output 330 [2022-07-12 19:19:15,035 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|)) (.cse9 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse5 (not .cse9)) (.cse21 (not .cse1))) (let ((.cse0 (or (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse22 (store (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse24 (store (select |c_#memory_$Pointer$.base| .cse24) v_arrayElimCell_300 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse22 .cse23) v_arrayElimCell_302) .cse23))))) .cse21)) (.cse10 (let ((.cse14 (or (forall ((v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse18 (store (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse20 (store (select |c_#memory_$Pointer$.base| .cse20) v_arrayElimCell_301 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse18 .cse19) v_arrayElimCell_302) .cse19))))) .cse21))) (and (or .cse5 (and (or (forall ((v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse12 (store (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimCell_301 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse11 (select (select .cse12 .cse11) v_arrayElimCell_303)))))) .cse1) .cse14)) (or .cse9 (and (or .cse1 (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse16 (store (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse17 (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimCell_301 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse15 (select (select .cse16 .cse15) v_arrayElimCell_300))))))) .cse14)))))) (and (or (and .cse0 (or .cse1 (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse4 (store (select |c_#memory_$Pointer$.base| .cse4) v_arrayElimCell_300 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse2 .cse3) v_arrayElimCell_303) .cse3))))))) .cse5) (or (and (or .cse1 (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse6 (store (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse8 (store (select |c_#memory_$Pointer$.base| .cse8) v_arrayElimCell_300 |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base|))) |c_ULTIMATE.start_sll_circular_append_~new_last~0#1.base| v_ArrVal_2556))) (let ((.cse7 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse6 .cse7) v_arrayElimCell_300) .cse7)))))) .cse0) .cse9) (or .cse10 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) .cse10))))) is different from false [2022-07-12 19:19:15,365 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|)) (.cse10 (= |c_ULTIMATE.start_main_~#s~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|)))) (let ((.cse5 (not .cse10)) (.cse21 (not .cse4))) (let ((.cse0 (or .cse21 (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_302 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse22 (store (let ((.cse24 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse24 (store (select |c_#memory_$Pointer$.base| .cse24) v_arrayElimCell_300 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2556))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse22 .cse23) v_arrayElimCell_302) .cse23))))))) (.cse6 (let ((.cse14 (or (forall ((v_arrayElimCell_302 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse18 (store (let ((.cse20 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse20 (store (select |c_#memory_$Pointer$.base| .cse20) v_arrayElimCell_301 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2556))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse18 .cse19) v_arrayElimCell_302) .cse19))))) .cse21))) (and (or .cse5 (and (or (forall ((v_arrayElimCell_301 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse11 (store (let ((.cse13 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse13 (store (select |c_#memory_$Pointer$.base| .cse13) v_arrayElimCell_301 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2556))) (let ((.cse12 (select (select .cse11 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse11 .cse12) v_arrayElimCell_303) .cse12))))) .cse4) .cse14)) (or (and (or (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_301 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse16 (store (let ((.cse17 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse17 (store (select |c_#memory_$Pointer$.base| .cse17) v_arrayElimCell_301 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2556))) (let ((.cse15 (select (select .cse16 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse15 (select (select .cse16 .cse15) v_arrayElimCell_300)))))) .cse4) .cse14) .cse10))))) (and (or (and .cse0 (or (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_arrayElimCell_303 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse2 (store (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse3 (store (select |c_#memory_$Pointer$.base| .cse3) v_arrayElimCell_300 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2556))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse1 (select (select .cse2 .cse1) v_arrayElimCell_303)))))) .cse4)) .cse5) (or .cse6 (= |c_ULTIMATE.start_main_~#s~0#1.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|)) (or (and .cse0 (or (forall ((v_arrayElimCell_300 (_ BitVec 32)) (v_ArrVal_2556 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse7 (store (let ((.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_append_~head#1.base|) |c_ULTIMATE.start_sll_circular_append_~head#1.offset|))) (store |c_#memory_$Pointer$.base| .cse9 (store (select |c_#memory_$Pointer$.base| .cse9) v_arrayElimCell_300 |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base|))) |c_ULTIMATE.start_sll_circular_append_#t~ret9#1.base| v_ArrVal_2556))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse7 .cse8) v_arrayElimCell_300) .cse8))))) .cse4)) .cse10) (or (= |c_ULTIMATE.start_main_~#s~0#1.offset| |c_ULTIMATE.start_sll_circular_append_~head#1.offset|) .cse6))))) is different from false [2022-07-12 19:19:49,435 WARN L233 SmtUtils]: Spent 13.70s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 19:19:49,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [756717992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:19:49,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:19:49,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25] total 49 [2022-07-12 19:19:49,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406811240] [2022-07-12 19:19:49,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 19:19:49,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 19:19:49,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 19:19:49,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 19:19:49,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=3335, Unknown=22, NotChecked=600, Total=4160 [2022-07-12 19:19:49,440 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 49 states, 46 states have (on average 2.130434782608696) internal successors, (98), 42 states have internal predecessors, (98), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:19:59,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:19:59,907 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-07-12 19:19:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 19:19:59,908 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.130434782608696) internal successors, (98), 42 states have internal predecessors, (98), 5 states have call successors, (6), 4 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 56 [2022-07-12 19:19:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:19:59,908 INFO L225 Difference]: With dead ends: 95 [2022-07-12 19:19:59,908 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 19:19:59,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1858 ImplicationChecksByTransitivity, 46.8s TimeCoverageRelationStatistics Valid=347, Invalid=5963, Unknown=30, NotChecked=800, Total=7140 [2022-07-12 19:19:59,910 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1892 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 19:19:59,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1892 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 533 Invalid, 0 Unknown, 480 Unchecked, 0.8s Time] [2022-07-12 19:19:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 19:19:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2022-07-12 19:19:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 89 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) [2022-07-12 19:19:59,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 102 transitions. [2022-07-12 19:19:59,913 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 102 transitions. Word has length 56 [2022-07-12 19:19:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:19:59,913 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 102 transitions. [2022-07-12 19:19:59,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.130434782608696) internal successors, (98), 42 states have internal predecessors, (98), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-12 19:19:59,913 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 102 transitions. [2022-07-12 19:19:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 19:19:59,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:19:59,914 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:19:59,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Ended with exit code 0 [2022-07-12 19:20:00,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Forceful destruction successful, exit code 0 [2022-07-12 19:20:00,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-12 19:20:00,327 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 55 more)] === [2022-07-12 19:20:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:20:00,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1012998182, now seen corresponding path program 1 times [2022-07-12 19:20:00,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 19:20:00,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929955450] [2022-07-12 19:20:00,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:20:00,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 19:20:00,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 19:20:00,331 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 19:20:00,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-12 19:20:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:20:00,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 19:20:00,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:20:00,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:20:00,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 19:20:00,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 19:20:00,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3